The two-machine flow shop problem with arbitrary precedence relations

0.00 Avg rating—0 Votes

Article ID:	iaor19961181
Country:	Netherlands
Volume:	64
Issue:	2
Start Page Number:	249
End Page Number:	257
Publication Date:	Jan 1993
Journal:	European Journal of Operational Research
Authors:	McMahon Graham B., Lim Chong-John
Keywords:	programming: branch and bound

Abstract:

The n-job 2-machine flow shop problem with arbitrary precedence constraints is considered. A branch and bound algorithm which minimises the makespan is described. The bounds are computed by solving relaxed problems in which the constraints have a series-parallel form.

Reviews

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