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

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Scheduling with AND/OR Precedence Constraints

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

Skutella,  Martin
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

Moehring, R. H., Skutella, M., & Stork, F. (2004). Scheduling with AND/OR Precedence Constraints. SIAM Journal on Computing, 33, 393-415.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-2B36-D
Zusammenfassung
In many scheduling applications it is required that the processing of some job must be postponed until some other job, which can be chosen from a pre-given set of alternatives, has been completed. The traditional concept of precedence constraints fails to model such restrictions. Therefore, the concept has been generalized to so-called AND/OR precedence constraints which can cope with this kind of requirement. In the context of traditional precedence constraints, feasibility, transitivity, as well as the computation of earliest start times for jobs are fundamental, well-studied problems. The purpose of this paper is to provide efficient algorithms for these tasks for the more general and complex model of AND/OR precedence constraints. We show that feasibility as well as many questions related to transitivity can be solved by applying essentially the same linear-time algorithm. In order to compute earliest start times we propose two polynomial-time algorithms to cope with different classes of time distances between jobs.