Two-machine shop scheduling with zero and unit processing times

Two-machine shop scheduling with zero and unit processing times

0.00 Avg rating0 Votes
Article ID: iaor19992328
Country: Netherlands
Volume: 107
Issue: 2
Start Page Number: 378
End Page Number: 388
Publication Date: Jun 1998
Journal: European Journal of Operational Research
Authors: ,
Keywords: flowshop
Abstract:

We consider the two machine flow shop and open shop problems to minimize the weighted mean flow-time, processing times being equal to 0 or 1. The solution to the open shop problem is based on algorithms for the flow shop problem and the corresponding two parallel identical machine problem. For all problems O(n log n) algorithms are proposed.

Reviews

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