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ženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 309; číslo 1; s. 249 - 258
Hlavní autoři:	Qian, Jin, Han, Haiyan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.02.2022 Springer Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!