Approximation Schemes for Robust Makespan Scheduling Problems

Adam Kurpisz ()
Additional contact information
Adam Kurpisz: Wrocław University of Technology

A chapter in Operations Research Proceedings 2014, 2016, pp 327-333 from Springer

Abstract: 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.

Keywords: Scheduling Problem; Competitive Ratio; Online Counterpart; Polynomial Time Approximation Scheme (PTAS); Parallel Machine Makespan (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-28697-6_46

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_46

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().