Improved Formulations and Branch-and-Cut Algorithm for the Unrelated Parallel Machines Scheduling Problem with a Common Server and Job-Sequence Dependent Setup Times.
Youssouf HadhbiLaurent DeroussiNathalie GrangeonSylvie NorrePublished in: CoDIT (2023)
Keyphrases
- scheduling problem
- sequence dependent setup times
- parallel machines
- single machine scheduling problem
- flowshop
- setup times
- single machine
- total weighted tardiness
- np hard
- unrelated parallel machines
- processing times
- release dates
- single server
- dynamic programming
- computational complexity
- linear programming
- worst case
- maximum lateness
- objective function
- scheduling jobs
- strongly np hard
- precedence constraints
- search space
- competitive ratio
- lower bound
- production scheduling
- job shop scheduling problem
- markov random field
- combinatorial optimization