A binary branch and bound algorithm to minimize maximum scheduling cost

This paper examines a single machine scheduling problem of minimizing the maximum scheduling cost that is nondecreasing with job completion time. Job release dates and precedence constraints are considered. We assume that each job can be processed exactly once without preemption. This is a classical...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Omega (Oxford) Ročník 42; číslo 1; s. 9 - 15
Hlavní autori:	Chandra, Charu, Liu, Zhixin, He, Jun, Ruohonen, Toni
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier Ltd 01.01.2014 Pergamon Press Inc
Predmet:	Algorithms Branch & bound algorithms Branch and bound Cost reduction Health service Heuristic Job shops Manufacturing Mathematical problems Optimization algorithms Production scheduling Scheduling Studies Scheduling Health service Manufacturing Branch and bound
ISSN:	0305-0483, 1873-5274
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!