The two-machine flowshop scheduling problems with total tardiness

The two-machine flowshop scheduling problems with total tardiness

0.00 Avg rating0 Votes
Article ID: iaor19881019
Country: United Kingdom
Volume: 16
Start Page Number: 333
End Page Number: 340
Publication Date: Jun 1989
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

This paper considers the criterion of minimizing total job tardiness in the two-machine flowshop system. The conditions that determine which of a pair of adjacent jobs in a sequence should precede the other to minimize total job tardiness are derived. A branch-and-bound solution procedure to reach an optimal solution to the problem is developed. A simple and computationally efficient heuristic is also presented. Moreover, an illustrative example together with the computational characteristics of the algorithm and the heuristic is provided.

Reviews

Required fields are marked *. Your email address will not be published.