| Issue |
RAIRO-Oper. Res.
Volume 55, 2021
Regular 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 | |
| DOI | https://doi.org/10.1051/ro/2020117 | |
| Published online | 02 March 2021 | |
Scheduling with position-dependent weights, due-date assignment and past-sequence-dependent setup times
1
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: liuww_2010@163.com
Received:
5
March
2020
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.