Flow-shop scheduling with flexible processors

Flow-shop scheduling with flexible processors

0.00 Avg rating0 Votes
Article ID: iaor19951337
Country: United Kingdom
Volume: 22
Issue: 3
Start Page Number: 297
End Page Number: 306
Publication Date: Mar 1995
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics, programming: integer
Abstract:

The authors consider a permutation flow-shop where one or more processors is flexible. Two integer programming models are developed; one is for the case where the job sequence is given and the other is for the case where the job sequence is to be determined. In the former case, a heuristic is also developed to solve large-sized problems. Computational results of the heuristic are presented.

Reviews

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