Heuristic algorithms for a complex parallel machine scheduling problem

Heuristic algorithms for a complex parallel machine scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor200910689
Country: Germany
Volume: 16
Issue: 4
Start Page Number: 379
End Page Number: 390
Publication Date: Dec 2008
Journal: Central European Journal of Operations Research
Authors: , ,
Keywords: heuristics, vehicle routing & scheduling
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.

Reviews

Required fields are marked *. Your email address will not be published.