Abstract
In this paper we study the classical no-wait flowshop scheduling problem with makespan objective (F|no − wait|C max in the standard three-field notation). This problem is well-known to be a special case of the asymmetric traveling salesman problem (ATSP) and as such has an approximation algorithm with logarithmic performance guarantee. In this work we show a reverse connection, we show that any polynomial time α-approximation algorithm for the no-wait flowshop scheduling problem with makespan objective implies the existence of a polynomial-time α(1 + ε)-approximation algorithm for the ATSP, for any ε > 0. This in turn implies that all non-approximability results for the ATSP (current or future) will carry over to its special case. In particular, it follows that no-wait flowshop problem is APX-hard, which is the first non-approximability result for this problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Asadpour, A., Goemans, M.X., Madry, A., Oveis Gharan, S., Saberi, A.: An O(logn/loglogn)-approximation algorithm for the asymmetric traveling salesman problem. In: SODA, pp. 379–389 (2010)
Bläser, M.: A new approximation algorithm for the asymmetric TSP with triangle inequality. ACM Transactions on Algorithms 4(4) (2008)
Feige, U., Singh, M.: Improved approximation ratios for traveling salesperson tours and paths in directed graphs. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX and RANDOM 2007. LNCS, vol. 4627, pp. 104–118. Springer, Heidelberg (2007)
Frieze, A.M., Galbiati, G., Maffioli, F.: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12(1), 23–39 (1982)
Gilmore, P., Gomory, R.: Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Operations Research (12), 655–679 (1964)
Hall, N., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research (44), 510–525 (1996)
Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Journal of the ACM 52(4), 602–626 (2005)
Karpinski, M., Lampis, M., Schmied, R.: New inapproximability bounds for TSP. CoRR abs/1303.6437 (2013)
Lawler, E., Lenstra, J., Rinnooy Kan, A., Shmoys, D.: Sequencing and scheduling: Algorithms and complexity. In: Graves, S., Rinnooy Kan, A., Zipkin, P. (eds.) Handbooks in Operations Research and Management Science. Logistics of Production and Inventory, vol. 4, pp. 445–522. North-Holland, Amsterdam (1993)
Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. Journal of the ACM 27(3), 533–549 (1980)
Piehler, J.: Ein Beitrag zum Reihenfolgeproblem. Unternehmensforschung (4), 138–142 (1960)
Röck, H.: The three-machine no-wait flow shop is NP-complete. Journal of the ACM 31(2), 336–345 (1984)
Röck, H., Schmidt, G.: Machine aggregation heuristics in shop-scheduling. Methods of Operations Research (45), 303–314 (1983)
Spieksma, F.C.R., Woeginger, G.J.: The no-wait flow-shop paradox. Oper. Res. Lett. 33(6), 603–608 (2005)
Sviridenko, M.: Makespan minimization in no-wait flow shops: A polynomial time approximation scheme. SIAM Journal of Discrete Mathematics 16(2), 313–322 (2003)
Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)
Wismer, D.A.: Solution of the flow shop scheduling problem with no intermediate queues. Operations Research (20), 689–697 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mucha, M., Sviridenko, M. (2013). No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39206-1_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-39206-1_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39205-4
Online ISBN: 978-3-642-39206-1
eBook Packages: Computer ScienceComputer Science (R0)