A "Branch-and-Bound" Algorithm for the Exact Solution of the Three-Machine Scheduling Problem

OR ◽  
1965 ◽  
Vol 16 (1) ◽  
pp. 89 ◽  
Author(s):  
Z. A. Lomnicki
Keyword(s):  
Exact Solution ◽  
Branch And Bound ◽  
Machine Scheduling ◽  
Branch And Bound Algorithm ◽  
Scheduling Problem

An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints

2020 ◽  
Author(s):  
Wenda Zhang ◽  
Jason J. Sauppe ◽  
Sheldon H. Jacobson
Keyword(s):  
Branch And Bound ◽  
Machine Scheduling ◽  
Precedence Constraints ◽  
Branch And Bound Algorithm ◽  
Scheduling Problem ◽  
Delivery Times ◽  
Problem Instances ◽  
One Machine Scheduling ◽  
The One ◽  
One Machine

In this paper, we discuss the one-machine scheduling problem with release and delivery times with the minimum makespan objective. Both heuristics and branch-and-bound algorithms have been formulated for the problem. One such branch-and-bound algorithm solves the problem and a variation that requires a delay between the completion of one job and the start of another (delayed precedence constraints). This paper analyzes key components of this branch-and-bound algorithm and proposes an improved heuristic to be used in conjunction with a different search strategy. Computational experiments demonstrate that the modifications lead to substantial improvements in running time and number of iterations on the one-machine problem instances both with and without delayed precedence constraints.

Sign in / Sign up

Export Citation Format

Share Document