Solving an Unrelated Parallel Machines Scheduling Problem with machine- and job-dependent setups and precedence constraints considering Support Machines
| Year of publication: |
2024
|
|---|---|
| Authors: | Muñoz-Díaz, María-Luisa ; Escudero-Santana, Alejandro ; Lorenzo-Espejo, Antonio |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 163.2024, Art.-No. 106511, p. 1-13
|
| Subject: | Scheduling | Simulated annealing | Constructive heuristic | Support machines | Tabu search | Unrelated parallel machines | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Theorie | Theory | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Produktionsplanung | Production planning | Produktionssteuerung | Production control |
-
Schaller, Jeffrey, (2019)
-
A note on scheduling on uniform parallel machines with unavailability constraints
Xu, Dehua, (2021)
-
Bicriteria scheduling problem for unrelated parallel machines with release dates
Lin, Yang-Kuei, (2014)
- More ...
-
A review of unsupervised k-value selection techniques in clustering algorithms
Pegado-Bardayo, Ana, (2024)
-
A framework for analyzing service disruptions in last-mile and first-mile reverse logistics
Lorenzo-Espejo, Antonio, (2024)
-
The one container drayage problem with soft time windows
Escudero-Santana, Alejandro, (2021)
- More ...