Improved algorithms for proportionate flow shop scheduling with due-window assignment

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 i...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Annals of operations research Ročník 309; číslo 1; s. 249 - 258
Hlavní autori: Qian, Jin, Han, Haiyan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.02.2022
Springer
Springer Nature B.V
Predmet:
Algorithms
Business and Management
Combinatorics
Job shop scheduling
Job shops
Machine shops
Management
Methods
Operations research
Operations Research/Decision Theory
Original Research
Scheduling
Scheduling (Management)
Theory of Computation
China
Scheduling
Due-window assignment
Position-dependent weights
Proportionate flow shop
Algorithm complexity
ISSN:0254-5330, 1572-9338
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 .
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-021-04414-4