Bicriterion scheduling in the two-machine flowshop

Bicriterion scheduling in the two-machine flowshop

0.00 Avg rating0 Votes
Article ID: iaor1999664
Country: United Kingdom
Volume: 48
Issue: 9
Start Page Number: 929
End Page Number: 935
Publication Date: Sep 1997
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: flowshop
Abstract:

Bicriterion scheduling problems have attracted the attention of many researchers, especially in the past decade. Although more than fifty papers have been published on this topic, most studies done so far focus only on a single machine. In this paper, we extend the development to the two-machine case and present algorithms for the bicriterion of minimising makespan and number of tardy jobs and of makespan and total tardiness. Computational results are also presented.

Reviews

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