IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v16y2008i4p379-390.html
   My bibliography  Save this article

Heuristic algorithms for a complex parallel machine scheduling problem

Author

Listed:
  • Zoltán Blázsik
  • Csanád Imreh
  • Zoltán Kovács

Abstract

In this work we present a new scheduling model for parallel machines, which extends the multiprocessor scheduling problem with release times for minimizing the total tardiness, and also extends the problem of vehicle routing with time windows. This new model is motivated by a resource allocation problem, which appears in the service sector. We present two class of heuristic algorithms for the solution of the problem, the first class is a class of greedy algorithms, the second class is based on the solutions of linear assignment problems. Furthermore we give a rescheduling algorithm, which improves a given feasible solution of the problem. Copyright Springer-Verlag 2008

Suggested Citation

  • Zoltán Blázsik & Csanád Imreh & Zoltán Kovács, 2008. "Heuristic algorithms for a complex parallel machine scheduling problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(4), pages 379-390, December.
    • Handle: RePEc:spr:cejnor:v:16:y:2008:i:4:p:379-390
    DOI: 10.1007/s10100-008-0066-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-008-0066-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-008-0066-y?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. Lau, Hoong Chuin & Sim, Melvyn & Teo, Kwong Meng, 2003. "Vehicle routing problem with time windows and a limited number of vehicles," European Journal of Operational Research, Elsevier, vol. 148(3), pages 559-569, August.
    2. Shim, Sang-Oh & Kim, Yeong-Dae, 2007. "Scheduling on parallel identical machines to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 177(1), pages 135-146, February.
    3. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2007. "An exact algorithm for a single-vehicle routing problem with time windows and multiple routes," European Journal of Operational Research, Elsevier, vol. 178(3), pages 755-766, May.
    4. Baptiste, Philippe & Carlier, Jacques & Jouglet, Antoine, 2004. "A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates," European Journal of Operational Research, Elsevier, vol. 158(3), pages 595-608, November.
    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. Petr Kučera, 2012. "Different versions of the savings method for the time limited vehicle routing problem," Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, Mendel University Press, vol. 60(7), pages 171-178.
    2. Hermann Maurer & Rizwan Mehmood, 2015. "Merging image databases as an example for information integration," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(2), pages 441-458, June.

    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. Daniel Schubert & André Scholz & Gerhard Wäscher, 2017. "Integrated Order Picking and Vehicle Routing with Due Dates," FEMM Working Papers 170007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    2. Daniel Schubert & André Scholz & Gerhard Wäscher, 2018. "Integrated order picking and vehicle routing with due dates," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1109-1139, October.
    3. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    4. Sébastien Mouthuy & Florence Massen & Yves Deville & Pascal Van Hentenryck, 2015. "A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 49(2), pages 223-238, May.
    5. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    6. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    7. Tang, Jiafu & Yu, Yang & Li, Jia, 2015. "An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 114-132.
    8. Rivera, Juan Carlos & Murat Afsar, H. & Prins, Christian, 2016. "Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 249(1), pages 93-104.
    9. Fagui Liu & Lvshengbiao Wang & Mengke Gui & Yang Zhang & Yulin Lan & Chengqi Lai & Boyuan Zhu, 2023. "A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window," Journal of Heuristics, Springer, vol. 29(2), pages 269-311, June.
    10. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    11. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2010. "An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles," European Journal of Operational Research, Elsevier, vol. 202(3), pages 756-763, May.
    12. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    13. Rui Yan & Haotong Tian & Kaiye Gao & Rui Peng & Bin Liu, 2023. "A two-stage UAV routing problem with time window considering rescheduling with random delivery reliability," Journal of Risk and Reliability, , vol. 237(4), pages 781-797, August.
    14. Bo Sun & Ming Wei & Chunfeng Yang & Zhihuo Xu & Han Wang, 2018. "Personalised and Coordinated Demand-Responsive Feeder Transit Service Design: A Genetic Algorithms Approach," Future Internet, MDPI, vol. 10(7), pages 1-14, July.
    15. Jouglet, Antoine & Savourey, David & Carlier, Jacques & Baptiste, Philippe, 2008. "Dominance-based heuristics for one-machine total cost scheduling problems," European Journal of Operational Research, Elsevier, vol. 184(3), pages 879-899, February.
    16. RuiYang Li & Ming He & HongYue He & QiaoYu Deng, 2022. "Heuristic column generation for designing an express circular packaging distribution network," Operational Research, Springer, vol. 22(2), pages 1103-1126, April.
    17. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    18. Ansaripoor, Amir H. & Oliveira, Fernando S., 2018. "Flexible lease contracts in the fleet replacement problem with alternative fuel vehicles: A real-options approach," European Journal of Operational Research, Elsevier, vol. 266(1), pages 316-327.
    19. Ehmke, Jan Fabian & Campbell, Ann Melissa, 2014. "Customer acceptance mechanisms for home deliveries in metropolitan areas," European Journal of Operational Research, Elsevier, vol. 233(1), pages 193-207.
    20. Chase C. Murray & Mark H. Karwan, 2010. "An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(7), pages 634-652, October.

    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:spr:cejnor:v:16:y:2008:i:4:p:379-390. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.