Skip to main content
SpringerLink
Log in

Heuristic algorithms for a complex parallel machine scheduling problem

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Azi N, Gendreau M, Potvin JV (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 178(3): 755–766

    Article  Google Scholar 

  • Baptiste P, Carlier J, Jouglet A (2004) A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. Eur J Oper Res 158(3): 595–608

    Article  Google Scholar 

  • Burkard RE, Cela E (1999) Linear assignment problems and extensions. Handbook of combinatorial optimization, Supplement vol A. Kluwer, Dordrecht, pp 75–149

  • Lau HC, Sim M, Teo KM (2003) Vehicle routing problem with time windows and a limited number of vehicles. Eur J Oper Res 148(3): 559–569

    Article  Google Scholar 

  • Drozdowski M (1996) Scheduling multiprocessor tasks—an overview. Eur J Oper Res 94: 215–230

    Article  Google Scholar 

  • Gutin G, Punnen PA (eds) (2002) The traveling salesman problem and its variations. Kluwer, Dordrecht

    Google Scholar 

  • Hashimoto H, Ibaraki T, Imahori S, Yagiura M (2006) The vehicle routing problem with flexible time windows and traveling times. Discrete Appl Math 154(16): 2271–2290

    Article  Google Scholar 

  • Shim SO, Kim YD (2007) Scheduling on parallel identical machines to minimize total tardiness. Eur J Oper Res 177(1): 135–146

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Blázsik, Csanád Imreh & Zoltán Kovács

Authors
  1. Zoltán Blázsik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Csanád Imreh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zoltán Kovács
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Csanád Imreh.

Additional information

This research has been supported by the Hungarian National Foundation for Scientific Research, Grant T046405.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blázsik, Z., Imreh, C. & Kovács, Z. Heuristic algorithms for a complex parallel machine scheduling problem. Cent Eur J Oper Res 16, 379–390 (2008). https://doi.org/10.1007/s10100-008-0066-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-008-0066-y

Keywords

Search

Navigation