New lower and upper bounds for scheduling around a small common due date

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

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Original languageEnglish
    Title of host publicationInteger Programming and Combinatorial Optimization
    Subtitle of host publicationproceedings of a conference held at Carnegie Mellon University, 25-27 May 1992
    EditorsA. Balas, G. Cornuejols, R. Kannan
    Place of PublicationPittsburg, PA, USA
    PublisherCarnegie Mellon University
    Publication statusPublished - 1 Sep 1992
    Event2nd Conference on Integer Programming and Combinatorial Optimization, IPCO 1992 - Pittsburg, United States
    Duration: 25 May 199227 May 1992
    Conference number: 2

    Conference

    Conference2nd Conference on Integer Programming and Combinatorial Optimization, IPCO 1992
    Abbreviated titleIPCO
    CountryUnited States
    CityPittsburg
    Period25/05/9227/05/92

    Cite this

    van de Velde, S. L., Hoogeveen, J. A., & Oosterhout, H. (1992). New lower and upper bounds for scheduling around a small common due date. In A. Balas, G. Cornuejols, & R. Kannan (Eds.), Integer Programming and Combinatorial Optimization: proceedings of a conference held at Carnegie Mellon University, 25-27 May 1992 Pittsburg, PA, USA: Carnegie Mellon University.