No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (2016)
Attributed to:
The Centre for Discrete Mathematics and its Applications (DIMAP)
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1287/moor.2015.0725
Publication URI: http://dx.doi.org/10.1287/moor.2015.0725
Type: Journal Article/Review
Parent Publication: Mathematics of Operations Research
Issue: 1