A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

Authors:
Ghaith Rabadi;Mansooreh Mollaghasemi;Georgios C. Anagnostopoulos
Affiliations:
Department of Engineering Management & Systems Engineering, Old Dominion University, Norfolk, VA;Department of Industrial Engineering & Management Systems, University of Central Florida, Orlando, FL;Department of Electrical Engineering and Computer Engineering, Florida Institute of Technology, Melbourne, FL
Venue:
Computers and Operations Research
Year:
2004

Citing 7
Cited 7

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Sequencing with earliness and tardiness penalties: a review

Operations Research
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
The weighted common due date single machine scheduling problem revisited

Computers and Operations Research
Early/tardy scheduling with sequence dependent setups on uniform parallel machines

Computers and Operations Research
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

Computers and Operations Research

Earliness-tardiness scheduling with setup considerations

Computers and Operations Research
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

Computers and Operations Research
A differential evolution approach for the common due date early/tardy job scheduling problem

Computers and Operations Research
A memetic algorithm-based heuristic for a scheduling problem in printed circuit board assembly

Computers and Industrial Engineering
An adaptive genetic algorithm to the single machine scheduling problem with earliness and tardiness penalties

SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

Computers and Operations Research
Artificial chromosomes with genetic algorithm 2 (ACGA2) for single machine scheduling problems with sequence-dependent setup times

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The single-machine early/tardy (E/T) scheduling problem is addressed in this research. The objective of this problem is to minimize the total amount of earliness and tardiness. Earliness and tardiness, are weighted equally and the due date is common and large (unrestricted) for all jobs. Machine setup time is included and is considered sequence-dependent. When sequence-dependent setup times are included, the complexity of the problem increases significantly and the problem becomes NP-hard. In the literature, only mixed integer programming formulation is available to optimally solve the problem at hand. In this paper, a branch-and-bound algorithm (B&B) is developed to obtain optimal solutions for the problem. As it will be shown, the B&B solved problems three times larger than what has been reported in the literature.