Two parallel machines scheduling

Authors:
Sheng-Fuu Lin;Jaw-Yeh Chen
Affiliations:
National Chiao Tung University, Department of Electrical and Control Engineering, 1001 Ta Hsueh Road, Hsinchu, Taiwan 30010, R.O.C;National Chiao Tung University, Department of Electrical and Control Engineering, 1001 Ta Hsueh Road, Hsinchu, Taiwan 30010, R.O.C
Venue:
Systems Analysis Modelling Simulation
Year:
2002

Citing 5
Cited 0

The single machine early/tardy problem

Management Science
Sequencing with earliness and tardiness penalties: a review

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

Computers and Operations Research
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, we study a two-parallel machine's early-tardy scheduling problem where some jobs need to be processed by one machine, while the others have to be processed by both machines simultaneously. The objective is to minimize the total earliness and tardiness penalties. Some optimality properties are derived, and then a heuristic method that can find approximate solutions efficiently is proposed. The method can solve 1000-job problems very quickly as the simulation results show.