Alternative formulations of a flow-shop scheduling problem

Alternative formulations of a flow-shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor1988537
Country: United Kingdom
Volume: 40
Issue: 4
Start Page Number: 395
End Page Number: 399
Publication Date: Apr 1989
Journal: Journal of the Operational Research Society
Authors:
Abstract:

This paper presents an alternative approach to an earlier model developed by other authors to formulate a problem of sequencing N jobs on M machines in a standard flow-shop. The objectives of the model are to minimize makespan and flow-time. The new formulation involves substantially fewer variables, at the expense of a rise in the number of constraints, Practical limitations of both approaches are discussed.

Reviews

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