Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers.
Hyun-Jung KimJun-Ho LeePublished in: Comput. Oper. Res. (2021)
Keyphrases
- sequence dependent setup times
- identical machines
- parallel machines
- flowshop
- scheduling problem
- single machine
- maximum lateness
- precedence constraints
- processing times
- batch processing machines
- release dates
- parallel machine scheduling problem
- single machine scheduling problem
- setup times
- total weighted tardiness
- identical parallel machines
- tardiness penalties
- shared memory
- special case
- parallel computing
- job shop
- branch and bound algorithm
- lot sizing
- strongly np hard
- approximation algorithms
- tardiness cost
- np hard
- tabu search
- upper bound
- multi item
- single server
- arrival rate
- linear programming
- response time
- dynamic programming