Results 11 to 20 of about 7,150,473 (243)
Machine learning to analyze single‐case graphs: A comparison to visual inspection [PDF]
, 2021 Behavior analysts commonly use visual inspection to analyze single-case graphs, but studies on its reliability have produced mixed results. To examine this issue, we compared the Type I error rate and power of visual inspection with a novel approach ...
Marc J. Lanovaz +4 more
core +1 more source
Single machine scheduling and due date assignment under series-parallel precedence constraints
, 2005 We consider a single machine due date assignment and scheduling problem of minimizing holding costs with no tardy jobs tinder series parallel and somewhat wider class of precedence constraints as well as the properties of series-parallel ...
Gordon, Valery +2 more
core +6 more sources
Machine-Learning Enhanced Enantioselective Single-Shot-Single-Molecule ac Stark Spectroscopy
, 2023 Enantiodiscrimination with single-molecule and single-shot resolution is fundamental for the understanding of the fate and behavior of two enantiomers in chemical reactions, biological activity, and the function of drugs.
Chong Ye (8768067) +2 more
core +1 more source
MULTIPLE OBJECTIVE FUNCTION ON A SINGLE MACHINE SCHEDULING
Journal of Kufa for Mathematics and Computer, 2010 We consider a single machine scheduling problem to minimize a multiple objective function; sum of earliness, tardiness and completion time. As this problem is complete NP-hard we propose a branch and bound algorithm to obtain an optimal solution.
Abdul Razaq T. S. . S +2 more
doaj +1 more source
Single Machine Vector Scheduling with General Penalties
Mathematics, 2021 In this paper, we study the single machine vector scheduling problem (SMVS) with general penalties, in which each job is characterized by a d-dimensional vector and can be accepted and processed on the machine or rejected.
Xiaofei Liu, Weidong Li, Yaoyu Zhu
doaj +1 more source
Ant Colony Method to Minimize Single Machine Scheduling Problem
مجلة علوم ذي قار, 2019 The study deal with a single machine scheduling problem where the objective is to find the sequence which it give the optimal or efficient solution for the objective function the sum of discounted weighted completion time and number of tardy jobs.
Sami .M Araibi
doaj +4 more sources
Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective
Algorithms, 2018 We consider a single machine scheduling problem with uncertain durations of the given jobs. The objective function is minimizing the sum of the job completion times.
Yuri N. Sotskov, Natalja G. Egorova
doaj +1 more source
Single Machine Job Sequencing With a Restricted Common Due Window
IEEE Access, 2019 This article deals with the problem of sequencing $N$ jobs on a single machine with a restrictive common due window. The objective is to minimize the total weighted earliness-tardiness penalties, which conform to just-in-time (JIT) manufacturing. A novel
Shih-Wei Lin +3 more
doaj +1 more source
Zhejiang Daxue xuebao. Lixue ban, 2008 The single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints is considered. There are some fixed jobs which are already fixed in the schedule.
YANGAi-feng(杨爱峰) +1 more
doaj +1 more source
A Single Machine Scheduling Problem Considering Machine Availability Constraints
Shanghai Jiaotong Daxue xuebao, 2021 The study described in this paper is derived from a real rotor production workshop where low reliability leads to poor quality of workpieces. A single machine scheduling problem considering machine availability constraints is addressed.
WANG Jinfeng, CHEN Lu, YANG Wenhui
doaj +1 more source