IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v171y2006i1p107-122.html
   My bibliography  Save this article

Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints

Author

Listed:
  • Lushchakova, Irene N.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:171:y:2006:i:1:p:107-122
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00617-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Peter Brucker & Johann Hurink & Sigrid Knust, 2003. "A polynomial algorithm for P | p j =1, r j , outtree | ∑ C j," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 56(3), pages 407-412, January.
    2. Lee A. Herrbach & Joseph Y.-T. Leung, 1990. "Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time," Operations Research, INFORMS, vol. 38(3), pages 487-494, June.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Agnetis, Alessandro & Flamini, Marta & Nicosia, Gaia & Pacifici, Andrea, 2010. "Scheduling three chains on two parallel machines," European Journal of Operational Research, Elsevier, vol. 202(3), pages 669-674, May.
    2. Bryant, Richard & Lakner, Peter & Pinedo, Michael, 2022. "On the optimality of the earliest due date rule in stochastic scheduling and in queueing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 202-212.
    3. 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.
    4. 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.

    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. Bo Chen & Ed Coffman & Dariusz Dereniowski & Wiesław Kubiak, 2016. "Normal-form preemption sequences for an open problem in scheduling theory," Journal of Scheduling, Springer, vol. 19(6), pages 701-728, December.
    2. 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.
    3. Lushchakova, Irina N., 2012. "Preemptive scheduling of two uniform parallel machines to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 219(1), pages 27-33.
    4. 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.
    5. 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.
    6. 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.
    7. Azizoglu, Meral, 2003. "Preemptive scheduling on identical parallel machines subject to deadlines," European Journal of Operational Research, Elsevier, vol. 148(1), pages 205-210, July.
    8. 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.
    9. 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.
    10. Yumei Huo & Joseph Leung, 2005. "Minimizing total completion time for UET tasks with release time and outtree precedence constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(2), pages 275-279, November.
    11. Ramudhin, Amar & Marier, Philippe, 1996. "The generalized Shifting Bottleneck Procedure," European Journal of Operational Research, Elsevier, vol. 93(1), pages 34-48, August.
    12. 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.
    13. 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:eee:ejores:v:171:y:2006:i:1:p:107-122. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.