Article ID: | iaor1994532 |
Country: | United States |
Volume: | 4 |
Issue: | 1 |
Start Page Number: | 5 |
End Page Number: | 16 |
Publication Date: | Aug 1991 |
Journal: | International Journal of Flexible Manufacturing Systems |
Authors: | Laporte Gilbert, Eiselt Horst A., Weglarz Jan, Blazewicz Jacek, Finke Gerd |
Keywords: | scheduling |
Due to their increasing applicability in modern industry, flexible manufacturing systems (FMSs), their design, and their control have been studied extensively in the recent literature. One of the most important issues that has arisen in this context is the FMS scheduling problem. This article is concerned with a new model of an FMS system, motivated by the practical application that takes into account both machine and vehicle scheduling. For the case of a given machine schedule, a simple polynomial-time algorithm is presented that checks the feasibility of a vehicle schedule and constructs it whenever one exists. Then a dynamic programming approach to construct optimal machine and vehicle schedules is proposed. This technique results in a pseudopolynomial-time algorithm for a fixed number of machines.