Back to Search
Start Over
Improved algorithms for proportionate flow shop scheduling with due-window assignment.
- Source :
-
Annals of Operations Research . Feb2022, Vol. 309 Issue 1, p249-258. 10p. - Publication Year :
- 2022
-
Abstract
- In a recent study, Sun et al. (AOR 292:113–131, 2020) studied due-window proportionate flow shop scheduling problems with position-dependent weights. For common due-window (denoted by CONW) and slack due-window (denoted by SLKW) assignment methods, they proved that these two problems can be solved in O (n 2 log n) time respectively, where n is the number of jobs. In this paper, we consider the same problems, and our contribution is that the CONW problem can be optimally solved by a lower-order algorithm, which runs in O (n log n) time, implying an improvement of a factor of n. [ABSTRACT FROM AUTHOR]
- Subjects :
- *FLOW shop scheduling
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 02545330
- Volume :
- 309
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Annals of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 154713563
- Full Text :
- https://doi.org/10.1007/s10479-021-04414-4