Minimizing weighted earliness–tardiness on parallel machines using hybrid metaheuristics |
| |
| Affiliation: | 1. University of Valencia, Department of Statistics and Operations Research, Burjassot, Valencia, Spain;2. Polytechnic University of Valencia, Department of Applied Statistics and Operations Research, and Quality, Valencia, Spain;1. Faculdade de Economia da Universidade do Porto, C/O Jorge Valente, Rua Dr. Roberto Frias, s/n, 4200-464 Porto, Portugal;2. LIAAD – INESCTEC LA, Faculdade de Economia da Universidade do Porto, Rua Dr. Roberto Frias, s/n, 4200-464 Porto, Portugal;3. Department of Business Administration, Eastern Connecticut State University, 83 Windham St., Willimantic, CT 06226-2295, USA;1. Radiation and Reactor Theory, The South African Nuclear Energy Corporation SOC Ltd, PO Box 582, Pretoria 0001, South Africa;2. Department of Logistics, Stellenbosch University, Private Bag X1, Matieland 7602, South Africa;3. Stellenbosch Unit for Operations Research in Engineering, Department of Industrial Engineering, Stellenbosch University, Private Bag X1, Matieland 7602, South Africa;1. Mathematical Institute SANU, Belgrade, Serbia;2. University of Seville, Seville, Spain;1. Department of International Trade, Chihlee Institute of Technology, New Taipei City 220, Taiwan;2. Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan |
| |
| Abstract: | We consider the problem of scheduling a set of jobs on a set of identical parallel machines where the objective is to minimize the total weighted earliness and tardiness penalties with respect to a common due date. We propose a hybrid heuristic algorithm for constructing good solutions, combining priority rules for assigning jobs to machines and a local search with exact procedures for solving the one-machine subproblems. These solutions are then used in two metaheuristic frameworks, Path Relinking and Scatter Search, to obtain high quality solutions for the problem.The algorithms are tested on a large number of test instances to assess the efficiency of the proposed strategies.The results show that our algorithms consistently outperform the best reported results for this problem. |
| |
| Keywords: | Scheduling Earliness-tardiness Parallel machines Hybrid metaheuristics Path Relinking Scatter Search |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
