Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment

Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment

0.00 Avg rating0 Votes
Article ID: iaor2002222
Country: United Kingdom
Volume: 39
Issue: 12
Start Page Number: 2635
End Page Number: 2657
Publication Date: Jan 2001
Journal: International Journal of Production Research
Authors: ,
Keywords: job shop
Abstract:

Two efficient cyclic scheduling heuristics for re-entrant job shop environments were developed. Each heuristic generated an efficient and feasible cyclic production schedule for a job shop in which a single product was produced repetitively on a set of machines, which simultaneously minimized flow time and cycle time. The first heuristic considered a repetitive production re-entrant job shop with a predetermined sequence of operations on a single product with known processing times, set-up and material handling times. The second heuristic was a specialization of the first heuristic where the set-up for an operation could commence even while the preceeding operation was in progress. These heuristics have been extensively tested and computational results are provided. Also, extensive analysis of worst-case and trade-offs between cycle time and flow time are provided. The results indicate that the proposed heuristics are robust and yield efficient and superior cyclic schedules with modest computational effort.

Reviews

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