.png){kind=icon}
.png){kind=icon}
Return
A binary branch and bound algorithm to minimize maximum scheduling cost
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2013.02.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Branch and bound
Health service
Manufacturing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
O
IF:
7.2
Papers:
3.7K
Citations:
1.4W