GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- 455 Downloads
In this work, we tackle the problem of scheduling a set of jobs on a set of non-identical parallel machines with the goal of minimising the total weighted completion times. GRASP is a multi-start method that consists of two phases: a solution construction phase, which randomly constructs a greedy solution, and an improvement phase, which uses that solution as an initial starting point. In the last few years, the GRASP methodology has arisen as a prospective metaheuristic approach to find high-quality solutions for several difficult problems in reasonable computational times. With the aim of providing additional results and insights along this line of research, this paper proposes a new GRASP model that combines the basic scheme with two significant elements that have been shown to be very successful in order to improve GRASP performance. These elements are path-relinking and evolutionary path-relinking. The benefits of our proposal in comparison to existing metaheuristics proposed in the literature are experimentally shown.
KeywordsNon-identical parallel machine scheduling problem with minimising total weighted completion times Metaheuristics GRASP Path-relinking
This work was supported by grant TIN2011-24124 of the Spanish government and by grant P08-TIC-4173 of the Andalusian regional goverment.
- Azizoglu, M., & Kirca, O. (1999b). Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions, 31(2), 153–159. Google Scholar
- Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., & Weglarz, J. (2007). International handbooks on information systems. Handbook on scheduling: models and methods for advanced planning. Secaucus: Springer. Google Scholar
- Glover, F. (1996). Tabu search and adaptive memory programing—advances, applications and challenges. In Interfaces in computer science and operations research (pp. 1–75). Norwell: Kluwer Academic. Google Scholar
- Hall, L. A., Shmoys, D. B., & Wein, J. (1996). Scheduling to minimize average completion time: off-line and on-line algorithms. In Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms, SODA’96 (pp. 142–151). Philadelphia: Society for Industrial and Applied Mathematics. Google Scholar
- Holm, S. (1979). A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 6, 65–70. Google Scholar
- Lenstra, J., Rinnooy-Kan, A., & Brucker, P. (1977). Complexity of machine scheduling problems. In B. K. P. L. Hammer, E. L. Johnson & G. Nemhauser (Eds.), Studies in integer programming, annals of discrete mathematics (Vol. 1, pp. 343–362). Amsterdam: Elsevier. Google Scholar
- Mokotoff, E. (2001). Parallel machine scheduling problems: a survey. Asia-Pacific Journal of Operational Research, 18(2), 193–242. Google Scholar
- Resende, M., & Ribeiro, C. (2003). Greedy randomized adaptive search procedures. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 219–249). Norwell: Kluwer Academic. Google Scholar
- Zaidi, M., Jarboui, B., Loukil, T., & Kacem, I. (2010). Hybrid meta-heuristics for uniform parallel machine to minimize total weighted completion time. In Proc. of 8th international conference of modeling and simulation (MOSIM’10). Google Scholar