IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v42y1995i1p141-145.html
   My bibliography  Save this article

Note: Open‐shop scheduling with release dates to minimize maximum lateness

Author

Listed:
  • Hans Kellerer
  • Thomas Tautenhahn
  • Gerhard Woeginger

Abstract

We present the first polynomial‐time algorithm for an open‐shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness. © 1995 John Wiley & Sons, Inc.

Suggested Citation

  • Hans Kellerer & Thomas Tautenhahn & Gerhard Woeginger, 1995. "Note: Open‐shop scheduling with release dates to minimize maximum lateness," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 141-145, February.
    • Handle: RePEc:wly:navres:v:42:y:1995:i:1:p:141-145
    DOI: 10.1002/1520-6750(199502)42:13.0.CO;2-3
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199502)42:13.0.CO;2-3
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199502)42:13.0.CO;2-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Peter Brucker & M. R. Garey & D. S. Johnson, 1977. "Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 275-284, August.
    2. C. Y. Liu & R. L. Bulfin, 1988. "Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates," Operations Research, INFORMS, vol. 36(4), pages 553-559, August.
    3. Teofilo Gonzalez, 1982. "Unit Execution Time Shop Problems," Mathematics of Operations Research, INFORMS, vol. 7(1), pages 57-66, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Timkovsky, Vadim G., 2003. "Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity," European Journal of Operational Research, Elsevier, vol. 149(2), pages 355-376, September.
    2. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    3. Baptiste, Philippe, 2003. "On minimizing the weighted number of late jobs in unit execution time open-shops," European Journal of Operational Research, Elsevier, vol. 149(2), pages 344-354, September.
    4. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    5. Panwalkar, S.S. & Koulamas, Christos, 2014. "The two-machine no-wait general and proportionate open shop makespan problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 471-475.
    6. Singh, Gaurav, 2005. "Scheduling UET-UCT outforests to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 165(2), pages 468-478, September.
    7. Yuri N. Sotskov, 2020. "Mixed Graph Colorings: A Historical Review," Mathematics, MDPI, vol. 8(3), pages 1-24, March.
    8. Kravchenko, Svetlana A., 1998. "A polynomial algorithm for a two-machine no-wait job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 106(1), pages 101-107, April.
    9. Christos Koulamas & George J. Kyparisis, 1998. "Open shop scheduling to minimize the number of late jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(5), pages 525-532, August.
    10. Lushchakova, Irene N., 2006. "Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints," European Journal of Operational Research, Elsevier, vol. 171(1), pages 107-122, May.
    11. D. Prot & O. Bellenguez-Morineau, 2018. "A survey on how the structure of precedence constraints may change the complexity class of scheduling problems," Journal of Scheduling, Springer, vol. 21(1), pages 3-16, February.
    12. Felix Happach, 2021. "Makespan minimization with OR-precedence constraints," Journal of Scheduling, Springer, vol. 24(3), pages 319-328, June.
    13. Jonas Harbering & Abhiram Ranade & Marie Schmidt & Oliver Sinnen, 2019. "Complexity, bounds and dynamic programming algorithms for single track train scheduling," Annals of Operations Research, Springer, vol. 273(1), pages 479-500, February.
    14. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    15. George Vairaktarakis & Sartaj Sahni, 1995. "Dual criteria preemptive open‐shop problems with minimum makespan," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 103-121, February.
    16. Tianyu Wang & Odile Bellenguez-Morineau, 2019. "The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints," Journal of Scheduling, Springer, vol. 22(3), pages 263-269, June.
    17. Ramudhin, Amar & Marier, Philippe, 1996. "The generalized Shifting Bottleneck Procedure," European Journal of Operational Research, Elsevier, vol. 93(1), pages 34-48, August.
    18. Burak Cankaya & Ezra Wari & Berna Eren Tokgoz, 2019. "Practical approaches to chemical tanker scheduling in ports: a case study on the Port of Houston," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 21(4), pages 559-575, December.
    19. Espelage, W. & Wanke, E., 2005. "A linear time approximation algorithm for movement minimization in conveyor flow shop processing," European Journal of Operational Research, Elsevier, vol. 160(2), pages 485-500, January.
    20. Matta, Marie E. & Elmaghraby, Salah E., 2010. "Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop," European Journal of Operational Research, Elsevier, vol. 201(3), pages 720-728, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:42:y:1995:i:1:p:141-145. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.