de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

A linear time approximation scheme for the job shop scheduling problem

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45136

Solis-Oba,  Roberto
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44695

Jansen,  Klaus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Solis-Oba, R., Jansen, K., & Sviridenko, M. (1999). A linear time approximation scheme for the job shop scheduling problem. In D. Hochbaum, K. Jansen, J. D. P. Rolim, & A. Sinclair (Eds.), Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99) (pp. 177-188). Berlin: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-3591-4
Zusammenfassung
We study the preemptive and non-preemptive versions of the job shop scheduling pr oblem when the number of machines and the number of operations per job are fixed. We present linear time approximation schemes for both problems. These algorithms are the best possible for such problems in two regards: they achieve the best po ssible performance ratio since both problems are known to be strongly NP-hard; an d they have optimum asymptotic time complexity.