Minimizing tardiness in a two-machine flow-shop

Authors:
Jason Chao-Hsien Pan;Jen-Shiang Chen;Chii-Ming Chao
Affiliations:
Department of Industrial Management, National Taiwan University of Science and Technology, 43 Keelung Road, Section 4, Taipei 106, Taiwan;Department of Industrial Engineering and Management, Far East College, 49 Chung Hua Road, Hsin Shih, Taiwan 744, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, 43 Keelung Road, Section 4, Taipei 106, Taiwan
Venue:
Computers and Operations Research
Year:
2002

Citing 3
Cited 12

The two-machine flowshop scheduling problem with total tardiness

Computers and Operations Research
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops

Computers and Operations Research

Note on minimizing total tardiness in a two-machine flowshop

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

Computers and Operations Research
Flow shop scheduling and its extension to fuzzy processing times

FS'08 Proceedings of the 9th WSEAS International Conference on Fuzzy Systems
Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops

Computers and Industrial Engineering
A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem

Information Sciences: an International Journal
Note on minimizing total tardiness in a two-machine flowshop

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops

Computers and Industrial Engineering
A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop

Computers and Operations Research
An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem

Computers and Industrial Engineering
Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries

Information Systems
An assignment-based lower bound for a class of two-machine flow shop problems

Computers and Operations Research
A novel genetic algorithm to solve travelling salesman problem and blocking flow shop scheduling problem

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

The two-machine flow-shop scheduling problem with the objective of minimizing total tardiness is considered in this paper. Dominance criteria are developed to establish the precedence constraints between jobs in an optimal schedule. A lower bound on the total tardiness of the problem is derived by constructing the sequence of jobs from front to back to simplify the bounding procedure. A branch-and-bound algorithm incorporating these properties is proposed to expedite the search for an optimal sequence. Computational experiments are conducted and the results demonstrate that the proposed algorithm surpasses an existing one in terms of both computation times and sizes of the problems solved.