Volume 55, 2021Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|Page(s)||S2747 - S2758|
|Published online||02 March 2021|
Scheduling with position-dependent weights, due-date assignment and past-sequence-dependent setup times
School of Science, Shenyang Aerospace University, Shenyang 110136, P.R. China
2 Department of Science, Shenyang Sport University, Shenyang 110102, P.R. China
* Corresponding author: firstname.lastname@example.org
Accepted: 10 October 2020
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.
Mathematics Subject Classification: 90B35
Key words: Scheduling / single-machine / past-sequence-dependent setup times / position-dependent weights
© EDP Sciences, ROADEF, SMAI 2021
Initial download of the metrics may take a while.