Business Commons^™

A Flowshop Scheduling Problem With Transportation Times And Capacity Constraints, Abraham Mendoza, Jose A. Ventura, Kwei Long Huang

11th IMHRC Proceedings (Milwaukee, Wisconsin. USA – 2010)

Although there are numerous methodologies and research studies on machine scheduling, most of the literature assumes that there is an unlimited number of transporters to deliver jobs from one machine to another for further processing and that transportation times can be neglected. These two assumptions are not applicable if one intends to generate an accurate schedule for the shop floor. In this research, a flowshop scheduling problem with two machines, denoted as M1 and M2, and a single transporter with capacity c is considered. The main focus is on the development of a dynamic programming algorithm to generate a schedule …