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ženo v:
Podrobná bibliografie
Vydáno v:Omega (Oxford) Ročník 42; číslo 1; s. 9 - 15
Hlavní autoři: Chandra, Charu, Liu, Zhixin, He, Jun, Ruohonen, Toni
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Elsevier Ltd 01.01.2014
Pergamon Press Inc
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 scheduling problem, and is specifically useful in the scheduling of medical treatments. We develop a simple branch and bound algorithm to solve the scheduling problem optimally. A binary branching technique is developed. We use a preemptive solution approach to locate a lower bound, and design a simple heuristic to find an upper bound. Our algorithm is easy to implement and finds optimal schedules in one CPU minute for almost all instances tested, with up to 1000 jobs. ► Minimizes maximum scheduling cost, with release dates and precedence constraints. ► Applicable in scheduling of medical treatments. ► Develops an easy-to-implement branch and bound algorithm. ► Optimally solves almost all random instances with up to 1000 jobs in one CPU minute.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0305-0483
1873-5274
DOI:10.1016/j.omega.2013.02.005