Flowshop scheduling with set-up, processing and removal times separated

Flowshop scheduling with set-up, processing and removal times separated

0.00 Avg rating0 Votes
Article ID: iaor19911299
Country: United Kingdom
Volume: 29
Issue: 3
Start Page Number: 189
End Page Number: 195
Publication Date: Mar 1991
Journal: International Journal of Production Research
Authors: , ,
Abstract:

Algorithms are developed for finding an optimal or near-optimal permutation schedule for the static flowshop scheduling problem where set-up, processing, and removal times are separable. Computational experience with the proposed heuristic algorithms indicates that they are quite effective in minimizing the makespan for a given problem.

Reviews

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