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

Ideal schedules in parallel machine settings

Author

Listed:
  • Jiang, Xiaojuan
  • Lee, Kangbok
  • Pinedo, Michael L.

Abstract

An ideal schedule is a schedule that simultaneously minimizes the two most popular scheduling objectives, namely the makespan and the total completion time. If a scheduling problem always has an ideal schedule, then the problem is called an ideal problem. We summarize ideal problem results of various scheduling problems in different machine environments and with job characteristics that include precedence constraints, release dates, processing times, eligibility constraints and preemptions. We present a comprehensive overview of ideal schedules including our new findings.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:290:y:2021:i:2:p:422-434
    DOI: 10.1016/j.ejor.2020.08.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720307013
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.08.010?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
    ---><---

    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. M.I. Dessouky & B.J. Lageweg & J.K. Lenstra & S.L. van de Velde, 1990. "Scheduling identical jobs on uniform parallel machines," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 44(3), pages 115-123, September.
    2. W. A. Horn, 1973. "Technical Note—Minimizing Average Flow Time with Parallel Machines," Operations Research, INFORMS, vol. 21(3), pages 846-847, June.
    3. 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.
    4. E. L. Lawler, 1973. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints," Management Science, INFORMS, vol. 19(5), pages 544-546, January.
    5. J. K. Lenstra & A. H. G. Rinnooy Kan, 1978. "Complexity of Scheduling under Precedence Constraints," Operations Research, INFORMS, vol. 26(1), pages 22-35, February.
    6. 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.
    7. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    8. 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.
    9. 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.
    10. Philippe Baptiste & Vadim G. Timkovsky, 2004. "Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 60(1), pages 145-153, September.
    11. Peter Brucker & Bernd Jurisch & Andreas Krämer, 1997. "Complexity of scheduling problems with multi-purpose machines," Annals of Operations Research, Springer, vol. 70(0), pages 57-73, April.
    12. T. C. Hu, 1961. "Parallel Sequencing and Assembly Line Problems," Operations Research, INFORMS, vol. 9(6), pages 841-848, December.
    13. 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.
    14. Peter Brucker & Johann Hurink & Wieslaw Kubiak, 1999. "Scheduling identical jobs with chain precedence constraints on two uniform machines," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 49(2), pages 211-219, April.
    15. Juntaek Hong & Kangbok Lee & Michael L. Pinedo, 2020. "Scheduling equal length jobs with eligibility restrictions," Annals of Operations Research, Springer, vol. 285(1), pages 295-314, February.
    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. Chen, Jianfu & Chu, Chengbin & Sahli, Abderrahim & Li, Kai, 2024. "A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs," European Journal of Operational Research, Elsevier, vol. 316(3), pages 856-872.
    2. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2023. "Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time," European Journal of Operational Research, Elsevier, vol. 305(2), pages 594-607.

    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. 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.
    2. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    3. 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.
    4. Felix Happach, 2021. "Makespan minimization with OR-precedence constraints," Journal of Scheduling, Springer, vol. 24(3), pages 319-328, June.
    5. 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.
    6. 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.
    7. Jia, Beizhen & Tierney, Kevin & Reinhardt, Line Blander & Pahl, Julia, 2022. "Optimal dual cycling operations in roll-on roll-off terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    8. 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.
    9. Nodari Vakhania, 2001. "Tight Performance Bounds of CP-Scheduling on Out-Trees," Journal of Combinatorial Optimization, Springer, vol. 5(4), pages 445-464, December.
    10. Ramachandra, Girish & Elmaghraby, Salah E., 2006. "Sequencing precedence-related jobs on two machines to minimize the weighted completion time," International Journal of Production Economics, Elsevier, vol. 100(1), pages 44-58, March.
    11. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    12. Ravindran Vijayalakshmi, Vipin & Schröder, Marc & Tamir, Tami, 2024. "Minimizing total completion time with machine-dependent priority lists," European Journal of Operational Research, Elsevier, vol. 315(3), pages 844-854.
    13. Han Hoogeveen & Petra Schuurman & Gerhard J. Woeginger, 2001. "Non-Approximability Results for Scheduling Problems with Minsum Criteria," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 157-168, May.
    14. Xing Chai & Wenhua Li, 2018. "Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 472-492, August.
    15. Zhang, An & Qi, Xiangtong & Li, Guanhua, 2020. "Machine scheduling with soft precedence constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 491-505.
    16. Celia A. Glass & Hans Kellerer, 2007. "Parallel machine scheduling with job assignment restrictions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(3), pages 250-257, April.
    17. Leah Epstein & Ido Yatsiv, 2017. "Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times," Journal of Scheduling, Springer, vol. 20(2), pages 115-127, April.
    18. Tianyu Wang & Odile Bellenguez, 2021. "Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time," Journal of Scheduling, Springer, vol. 24(6), pages 649-662, December.
    19. Finke, Gerd & Lemaire, Pierre & Proth, Jean-Marie & Queyranne, Maurice, 2009. "Minimizing the number of machines for minimum length schedules," European Journal of Operational Research, Elsevier, vol. 199(3), pages 702-705, December.
    20. Blazewicz, Jacek & Liu, Zhen, 2002. "Linear and quadratic algorithms for scheduling chains and opposite chains," European Journal of Operational Research, Elsevier, vol. 137(2), pages 248-264, March.

    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:290:y:2021:i:2:p:422-434. 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.