Note on minimizing total tardiness in a two-machine flowshop

Authors:
Jeffrey Schaller
Affiliations:
Department of Business Administration, Eastern Connecticut State University, 83 Windham St., Willimantic, CT 06226-2295, USA
Venue:
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Year:
2005

Citing 3
Cited 3

The two-machine flowshop scheduling problem with total tardiness

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

Computers and Operations Research
Minimizing tardiness in a two-machine flow-shop

Computers and Operations Research

Elite guided steady-state genetic algorithm for minimizing total tardiness in flowshops

Computers and Industrial Engineering
An assignment-based lower bound for a class of two-machine flow shop problems

Computers and Operations Research
Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note considers the problem of sequencing jobs to minimize total tardiness in a two-machine flowshop. The note shows how three dominance conditions and a lower bound previously developed for this problem can be improved. The note also proposes a new dominance condition. A branch-and-bound algorithm is developed that uses the improvements and new dominance condition. The algorithm is tested on randomly generated problems and the results of the test show that the improvements and new dominance condition improves the branch-and-bound algorithm's efficiency.