One-machine sequencing with release dates, delivery times and precedence constraints

1988 ◽  
Vol 20 (4) ◽  
pp. 483-490
Author(s):  
A. Adrabiński ◽  
J. Grabowski ◽  
M. Wodecki
Keyword(s):  
Precedence Constraints ◽  
Release Dates ◽  
Delivery Times ◽  
One Machine

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.

scholarly journals The Lagrangean Relaxation for the Flow Shop Scheduling Problem with Precedence Constraints, Release Dates and Delivery Times

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Marcelus Fabri ◽  
Helena Ramalhinho ◽  
Mauricio C. de Souza ◽  
Martin G. Ravetti
Keyword(s):  
Flow Shop ◽  
Mathematical Problem ◽  
Lagrangean Relaxation ◽  
Precedence Constraints ◽  
Flow Shop Scheduling ◽  
Computational Time ◽  
Release Dates ◽  
Delivery Times ◽  
Flow Shop Problem ◽  
Feasible Solutions

This work aims to present a methodology to support a company in the automotive business on scheduling the jobs on its final processes. These processes are: (i) checking the final product and (ii) loading the dispatch trucks. These activities are usually found in the outbound area of any manufacturing company. The problem faced is defined as the flow shop problem with precedence constraints, release dates, and delivery times. The major objective is to minimize the latest date a client receives its products. We present a time-indexed integer mathematical model to compute feasible solutions for the presented problem. Moreover, we take advantage of the Lagrangean Relaxation procedure to compute valid lower and upper bounds. The experiments were held based on the company’s premises. As a conclusion, the results showed that the methodology proposed was able to compute feasible solutions for all the instances tested. Also, the Lagrangean Relaxation approach was able to calculate better bounds in a shorter computational time than the Mathematical problem for the more complicated instances.

scholarly journals ALGORITHM FOR ONE MACHINE JOB SEQUENCING WITH PRECEDENCE CONSTRAINTS

1981 ◽  
Vol 24 (2) ◽  
pp. 159-169 ◽  
Author(s):  
Tetsuo Ichimori ◽  
Hiroaki Ishii ◽  
Toshio Nishida
Keyword(s):  
Precedence Constraints ◽  
Job Sequencing ◽  
One Machine
Sign in / Sign up

Export Citation Format

Share Document