scholarly journals Scheduling  with position-dependent weights, due-date assignment and past-sequence-dependent setup times

2020 ◽  
Author(s):  
Li-Yan Wang ◽  
Xue Huang ◽  
Wei-Wei Liu ◽  
Yu-Bin Wu ◽  
Ji-Bo Wang
Keyword(s):  
Single Machine Scheduling ◽  
Setup Times ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Sequence Dependent ◽  
Dependent Setup Times ◽  
Machine Scheduling Problems ◽  
Slk Due Date Assignment ◽  
Sequence Dependent Setup Times

In this study, we consider single-machine scheduling problems with  past-sequence-dependent (denoted by psd) setup times in which the setup times of jobs are proportional to the length of already processed jobs. Under  common (CON) and slack (SLK) due-date assignment methods, we prove that the   weighted sum of earliness, tardiness and due-date minimization remains polynomially solvable.  We also give some extensions for the scheduling problems with  psd setup times.

scholarly journals Due Date Single Machine Scheduling Problems with Nonlinear Deterioration and Learning Effects and Past Sequence Dependent Setup Times

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Hüseyin Ceylan
Keyword(s):  
Processing Time ◽  
Single Machine Scheduling ◽  
Setup Times ◽  
Scheduling Problems ◽  
Due Dates ◽  
Sequence Dependent ◽  
Special Cases ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

We present some problems against due dates with nonlinear learning and deterioration effects and past sequence dependent setup times. In this study, two effects (learning and deterioration) are used for the same processing time. The processing time of a job is shorter if it is scheduled later, rather than in the sequence. This phenomenon is known in the literature as a “learning effect.” On the other hand, in many realistic scheduling settings, a job processed later consumes more time than the same job processed earlier—this is known as scheduling with deteriorating jobs. In the past sequence dependent setup times approach, the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. In this study, we demonstrated that some problems with due dates remain polynomially solvable. However, for some other problems, we concentrated on finding polynomially solves under their special cases.

Sign in / Sign up

Export Citation Format

Share Document