Template-type: ReDif-Paper 1.0
Author-Name: Crama Yves
Author-Name: Klundert Joris van de
Author-workplace-name: METEOR
Title: Robotic flowshop scheduling is strongly NP-complete
Abstract: We consider a robotic flowshop model in which a single robot is responsible for the transportation of parts between machines and the amount of time that a part spends on a machine must be comprised in some predefined interval. The objective is to find a feasible schedule with minimal cycle time. Many researchers have proposed nonpolynomial solution methods for a variety of closely related robotic flowshop scheduling problems. This paper provides a proof that a basic version of this problem is strongly NP-Complete.
Keywords: mathematical economics and econometrics ; 
Series: Research Memoranda
Creation-Date: 1997
Number: 010
File-URL: http://digitalarchive.maastrichtuniversity.nl/fedora/objects/guid:696a532d-e39e-4963-a065-14cba571c4a9/datastreams/ASSET1/content
File-Format: application/pdf
File-Size: 164519
Handle: RePEc:unm:umamet:1997010