Reference : Robotic flowshop scheduling is strongly NP-complete
Parts of books : Contribution to collective works
Business & economic sciences : Quantitative methods in economics & management
Business & economic sciences : Production, distribution & supply chain management
http://hdl.handle.net/2268/202499
Robotic flowshop scheduling is strongly NP-complete
English
Crama, Yves mailto [Université de Liège > HEC-Ecole de gestion : UER > Recherche opérationnelle et gestion de la production >]
Van de Klundert, Joris []
1997
Ten Years LNMB
Klein Haneveld, W.K.
Vrieze, O.J.
Kallenberg, L.C.M.
CWI
CWI Tract 122
277-286
Yes
Amsterdam
The Netherlands
[en] 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.
Researchers
http://hdl.handle.net/2268/202499

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
RoboticFlowShopNPComplete1997.pdfAuthor preprint162.94 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.