Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window.
Gustavo Alencar RolimMarcelo Seido NaganoBruno de Athayde PrataPublished in: Comput. Oper. Res. (2023)
Keyphrases
- unrelated parallel machines
- scheduling problem
- parallel machines
- setup times
- scheduling jobs
- vehicle routing problem
- single machine
- metaheuristic
- tabu search
- open shop
- flowshop
- np hard
- precedence constraints
- job shop scheduling
- job shop
- single server
- vehicle routing
- lower bound
- release dates
- routing problem
- approximation algorithms
- resource allocation