No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem

First Author: Mucha M
Attributed to:  Probabilistic Rounding Algorithms for Mathematical Programming funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-39206-1_65

Publication URI: http://dx.doi.org/10.1007/978-3-642-39206-1_65

Type: Book Chapter

Book Title: Automata, Languages, and Programming (2013)

Page Reference: 769-779

ISBN: 978-3-642-39205-4

ISSN: 2662-1738