Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem
| Autor: | Haroldo Gambini Santos, Greet Van den Berghe, Cristiano Luís Turbino de França e Silva, Túlio Ângelo Machado Toffolo |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Mathematical optimization
Machine scheduling 021103 operations research Theoretical computer science Job shop scheduling Step counting Iterated local search Computer science Strategy and Management 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Computer Science Applications Management of Technology and Innovation Simulated annealing 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Business and International Management Completion time Heuristics Implementation |
| Zdroj: | International Transactions in Operational Research. 26:707-724 |
| ISSN: | 0969-6016 |
| DOI: | 10.1111/itor.12316 |
| Popis: | This work addresses the unrelated parallel machine scheduling problem with sequence-dependent setup times, in which a set of jobs must be scheduled for execution by one of the several available machines. Each job has a machine-dependent processing time. Furthermore, given multiple jobs, there are additional setup times, which vary based on the sequence and machine employed. The objective is to minimize the schedule's completion time (makespan). The problem is NP-hard and of significant practical relevance. The present paper investigates the performance of four different stochastic local search (SLS) methods designed for solving the particular scheduling problem: simulated annealing, iterated local search, late acceptance hill-climbing, and step counting hill-climbing. The analysis focuses on design questions, tuning effort, and optimization performance. Simple neighborhood structures are considered. All proposed SLS methods performed significantly better than two state-of-the-art hybrid heuristics, especially for larger instances. Updated best-known solutions were generated for 901 of the 1000 large benchmark instances considered, demonstrating that particular SLS methods are simple yet powerful alternatives to current approaches for addressing the problem. Implementations of the contributed algorithms have been made available to the research community. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text