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.
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
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
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
Drozdowski M (1996) Scheduling multiprocessor tasks—an overview. Eur J Oper Res 94: 215–230
Gutin G, Punnen PA (eds) (2002) The traveling salesman problem and its variations. Kluwer, Dordrecht
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
Shim SO, Kim YD (2007) Scheduling on parallel identical machines to minimize total tardiness. Eur J Oper Res 177(1): 135–146
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been supported by the Hungarian National Foundation for Scientific Research, Grant T046405.
Rights 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
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-008-0066-y