Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
| Autor: | Hanane Krim, David Duvivier, Rachid Benmansour, Nicolas Zufferey, Jean-Yves Potvin |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization 021103 operations research Supply chain management Hierarchy (mathematics) Job shop scheduling Program · Metaheuristic · Tabu search · Lexicographic optimization Computer science 0211 other engineering and technologies General Engineering 02 engineering and technology Management Science and Operations Research Linear Lexicographical order Tabu search 020901 industrial engineering & automation Job rejection Artificial Intelligence Integer ddc:650 Minification Metaheuristic Software Parallel machine scheduling · Job rejection · Periodic maintenance · Mixed |
| Zdroj: | Journal of scheduling (2021) |
| ISSN: | 1099-1425 1094-6136 |
| Popis: | We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink