scholarly journals Common Due-Date Assignment and Scheduling on Parallel Machines with Sequence-Dependent Setup Times

2013 ◽  
Vol 19 (1) ◽  
pp. 29-36
Author(s):  
Jun-Gyu Kim ◽  
Jae-Min Yu ◽  
Dong-Ho Lee
Author(s):  
Li-Yan Wang ◽  
Xue Huang ◽  
Wei-Wei Liu ◽  
Yu-Bin Wu ◽  
Ji-Bo Wang

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.


Sign in / Sign up

Export Citation Format

Share Document