Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system

Authors:
Ling-Huey Su
Affiliations:
Department of Industrial Engineering, Chung-Yuan Christian University, Chung-Li, Taiwan, ROC
Venue:
Computers and Operations Research
Year:
2009

Citing 2
Cited 2

Heuristics for multimachine scheduling problems with earliness and tardiness costs

Management Science
Makespan minimization subject to flowtime optimality on identical parallel machines

Computers and Operations Research

A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic

Expert Systems with Applications: An International Journal
Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This study addresses the identical parallel machine scheduling problem in which the total earliness and tardiness about a common due date are minimized subject to minimum total flowtime, P@?(E+T)/@?C"i. The problem is demonstrated to be transformed into a simplified version of the parallel machine problem with the objective of minimizing makespan subject to minimum total flowtime, P@?C"m"a"x/@?C"i. Several properties are considered to solve optimally the restricted version of the problem. A streamlined binary integer programming model is developed to solve the P@?C"m"a"x/@?C"i problem and the P@?(E+T)/@?C"i problem. Computational experiments indicate that the binary integer programming model is superior to the existing optimization algorithm for the P@?C"m"a"x/@?C"i problem in the literature.