Scheduling with target start times

J.A. Hoogeveen, S.L. van de Velde

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    48 Downloads (Pure)

    Abstract

    We address the single-machine problem of scheduling n independent jobs subject to target start times. Target start times are essentially release times that may be violated at a certain cost. The goal is to minimize an objective function that is composed of total completion time and maximum promptness, which measures the observance of these target start times. We show that in case of a linear objective function the problem is solvable in 0( n4 ) time if preemption is allowed or if total completion time outweighs maximum promptness.
    Original languageEnglish
    Title of host publicationTen years LNMB
    Subtitle of host publicationPh.D. research and graduate courses of the Dutch Network of Operations Research
    EditorsW.K. W.K. Klein Haneveld, O.J. Vrieze, L.C.M. Kallenberg
    Place of PublicationAmsterdam
    PublisherCentrum voor Wiskunde en Informatica
    Pages45-53
    ISBN (Print)90 6196 475X
    Publication statusPublished - 1997

    Publication series

    NameCWI Tract
    PublisherCWI
    Number122

    Keywords

    • METIS-144720

    Fingerprint Dive into the research topics of 'Scheduling with target start times'. Together they form a unique fingerprint.

  • Cite this

    Hoogeveen, J. A., & van de Velde, S. L. (1997). Scheduling with target start times. In W. K. W.K. Klein Haneveld, O. J. Vrieze, & L. C. M. Kallenberg (Eds.), Ten years LNMB: Ph.D. research and graduate courses of the Dutch Network of Operations Research (pp. 45-53). (CWI Tract; No. 122). Amsterdam: Centrum voor Wiskunde en Informatica.