Skip to main content
SpringerLink
Log in

Approximation Schemes for Robust Makespan Scheduling Problems

  • Conference paper
  • First Online:
Operations Research Proceedings 2014

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

Makespan Parallel Machine and Flow Shop Scheduling belong to the core of the polynomial optimization problems. Both problems are well studied and they are known to be NP-hard, thus no optimal polynomial time algorithm exists under certain theoretical assumptions. In this paper we present a Polynomial Time Approximation Scheme for the generalized Min-Max version of the problems and the Competitive Ratio Approximation Scheme for the online counterpart of considered problems. All the presented algorithms work in linear time in the input size.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bansal, N., Vredeveld, T., van der Zwaan, R.: Approximating vector scheduling: almost matching upper and lower bounds. In: Pardo, A., Viola, A. (eds.) LATIN, Lecture Notes in Computer Science, vol. 8392, pp. 47–59. Springer (2014)

    Google Scholar 

  2. Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput. 33(4), 837–851 (2004)

    Article  Google Scholar 

  3. Fishkin, A.V., Jansen, K., Mastrolilli, M.: Grouping techniques for scheduling problems: simpler and faster. Algorithmica 51(2), 183–199 (2008)

    Article  Google Scholar 

  4. Günther, E., Maurer, O., Megow, N., Wiese, A.: A new approach to online scheduling: approximating the optimal competitive ratio. In: Khanna, S. (ed.) SODA, pp. 118–128. SIAM (2013)

    Google Scholar 

  5. Kasperski, A., Kurpisz, A., Zielinski, P.: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. 217(1), 36–43 (2012)

    Article  Google Scholar 

  6. Kasperski, A., Kurpisz, A., Zielinski, P.: Parallel machine scheduling under uncertainty. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU (4), Communications in Computer and Information Science, vol. 300, pp. 74–83. Springer (2012)

    Google Scholar 

  7. Kurpisz, A., Mastrolilli, M., Stamoulis, G.: Competitive-ratio approximation schemes for makespan scheduling problems. In: Erlebach, T., Persiano, G. (eds.) WAOA, Lecture Notes in Computer Science, vol. 7846, pp. 159–172. Springer (2012)

    Google Scholar 

  8. Zhu, X., Li, Q., Mao, W., Chen, G.: Online vector scheduling and generalized load balancing. J. Parallel Distrib. Comput. 74(4), 2304–2309 (2014)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by the National Center for Science, grant 2013/09/B/ST6/01525. The Ph.D. dissertation of the author was supported by the National Center for Science within Ph.D. scholarship based on the decision number DEC-2013/08/T/ST1/00630.

Author information

Authors and Affiliations

  1. Faculty of Fundamental Problems of Technology, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Adam Kurpisz

Authors
  1. Adam Kurpisz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Kurpisz .

Editor information

Editors and Affiliations

  1. Operations Research, RWTH Aachen University, Aachen, Germany

    Marco Lübbecke

  2. Lehrstuhl II für Mathematik, RWTH Aachen University, Aachen, Germany

    Arie Koster

  3. RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Peter Letmathe

  4. E.ON Energy Research Center, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Reinhard Madlener

  5. Management Science, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Britta Peis

  6. Chair of Operations Management, RWTH Aachen University, Aachen, Germany

    Grit Walther

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kurpisz, A. (2016). Approximation Schemes for Robust Makespan Scheduling Problems. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_46

Download citation

Publish with us

Policies and ethics

Search

Navigation