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

A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines

Author

Listed:
  • Dunstall, Simon
  • Wirth, Andrew

Abstract

No abstract is available for this item.

Suggested Citation

  • Dunstall, Simon & Wirth, Andrew, 2005. "A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines," European Journal of Operational Research, Elsevier, vol. 167(2), pages 283-296, December.
    • Handle: RePEc:eee:ejores:v:167:y:2005:i:2:p:283-296
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00282-6
    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. Clyde L. Monma & Chris N. Potts, 1989. "On the Complexity of Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 37(5), pages 798-804, October.
    2. E. L. Lawler & J. M. Moore, 1969. "A Functional Equation and its Application to Resource Allocation and Sequencing Problems," Management Science, INFORMS, vol. 16(1), pages 77-84, September.
    3. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    4. Zhi-Long Chen & Warren B. Powell, 1999. "Solving Parallel Machine Scheduling Problems by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 78-94, February.
    5. H.A.J. Crauwels & C.N. Potts & L.N. Van Wassenhove, 1997. "Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time," Annals of Operations Research, Springer, vol. 70(0), pages 261-279, April.
    6. T. C. E. Cheng & Z.-L. Chen, 1994. "Parallel Machine Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 42(6), pages 1171-1174, December.
    7. Scott Webster, 1992. "New Bounds for the Identical Parallel Processor Weighted Flow Time Problem," Management Science, INFORMS, vol. 38(1), pages 124-136, January.
    8. Azizoglu, Meral & Kirca, Omer, 1999. "On the minimization of total weighted flow time with identical and uniform parallel machines," European Journal of Operational Research, Elsevier, vol. 113(1), pages 91-100, February.
    9. Michael H. Rothkopf, 1966. "Scheduling Independent Tasks on Parallel Processors," Management Science, INFORMS, vol. 12(5), pages 437-447, January.
    10. Webster, Scott, 1995. "Weighted flow time bounds for scheduling identical processors," European Journal of Operational Research, Elsevier, vol. 80(1), pages 103-111, January.
    11. Webster, S. T., 1993. "A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 70(3), pages 327-334, November.
    12. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    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. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    2. Mecler, Davi & Abu-Marrul, Victor & Martinelli, Rafael & Hoff, Arild, 2022. "Iterated greedy algorithms for a complex parallel machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 300(2), pages 545-560.
    3. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.

    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. Rabia Nessah & Chengbin Chu, 2010. "Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods," Annals of Operations Research, Springer, vol. 181(1), pages 359-375, December.
    2. Arthur Kramer & Anand Subramanian, 2019. "A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems," Journal of Scheduling, Springer, vol. 22(1), pages 21-57, February.
    3. 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.
    4. Xiangtong Qi, 2005. "A logistics scheduling model: Inventory cost reduction by batching," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 312-320, June.
    5. Daniel Kowalczyk & Roel Leus, 2018. "A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 768-782, November.
    6. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.
    7. Zhi-Long Chen & Warren B. Powell, 1999. "Solving Parallel Machine Scheduling Problems by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 78-94, February.
    8. Zhi‐Long Chen & Warren B. Powell, 2003. "Exact algorithms for scheduling multiple families of jobs on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 823-840, October.
    9. Liji Shen & Lars Mönch & Udo Buscher, 2013. "An iterative approach for the serial batching problem with parallel machines and job families," Annals of Operations Research, Springer, vol. 206(1), pages 425-448, July.
    10. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    11. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    12. Dominik Kress & Maksim Barketau & Erwin Pesch, 2018. "Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines," Journal of Scheduling, Springer, vol. 21(6), pages 595-606, December.
    13. Kramer, Arthur & Dell’Amico, Mauro & Iori, Manuel, 2019. "Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 275(1), pages 67-79.
    14. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    15. Ji, Min & Cheng, T.C.E., 2010. "Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan," European Journal of Operational Research, Elsevier, vol. 202(1), pages 90-98, April.
    16. J. M. van den Akker & J. A. Hoogeveen & S. L. van de Velde, 1999. "Parallel Machine Scheduling by Column Generation," Operations Research, INFORMS, vol. 47(6), pages 862-872, December.
    17. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    18. F. Rodriguez & C. Blum & C. García-Martínez & M. Lozano, 2012. "GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times," Annals of Operations Research, Springer, vol. 201(1), pages 383-401, December.
    19. Kerem Bülbül & Halil Şen, 2017. "An exact extended formulation for the unrelated parallel machine total weighted completion time problem," Journal of Scheduling, Springer, vol. 20(4), pages 373-389, August.
    20. F Jin & J N D Gupta & S Song & C Wu, 2010. "Single machine scheduling with sequence-dependent family setups to minimize maximum lateness," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1181-1189, July.

    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:167:y:2005:i:2:p:283-296. 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.