An approximation algorithm for the two-machine flow shop with a single transporter
Soper, Alan and Strusevich, Vitaly A. (2007) An approximation algorithm for the two-machine flow shop with a single transporter. International Journal of Foundations of Computer Science (ijfcs), 18 (3). pp. 565-591. ISSN 0129-0541Full text not available from this repository.
We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a –approximation algorithm that outputs a two-shipment schedule. We design a –approximation algorithm that finds schedules with at most three shipments, and this ratio cannot be improved, unless schedules with more shipments are created. This improvement is achieved due to a thorough analysis of schedules with two and three shipments by means of linear programming. We formulate problems of finding an optimal schedule with two or three shipments as integer linear programs and develop strongly polynomial algorithms that find solutions to their continuous relaxations with a small number of fractional variables.
|Additional Information:||This paper forms part of the published proceedings from 8th Workshop on Models and Algorithms for Planning and Scheduling (MAPSP 2007), Istanbul, Turkey, July 2-6, 2007|
|Uncontrolled Keywords:||flow shop scheduling, scheduling with transportation, approximation algorithm, linear relaxation,|
|Subjects:||Q Science > QA Mathematics|
|School / Department / Research Groups:||School of Computing & Mathematical Sciences|
School of Computing & Mathematical Sciences > Computer & Computational Science Research Group
School of Computing & Mathematical Sciences > Department of Computer Science
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
School of Computing & Mathematical Sciences > Statistics & Operational Research Group
|Last Modified:||12 Apr 2011 14:53|
Actions (login required)