An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart.
Hailing LiuXiwen LuPublished in: Asia Pac. J. Oper. Res. (2021)
Keyphrases
- scheduling problem
- flowshop
- minimizing total tardiness
- parallel machines
- identical machines
- batch processing
- minimizing makespan
- unrelated parallel machines
- single machine
- online algorithms
- sequence dependent setup times
- setup times
- batch mode
- strongly np hard
- processing times
- tabu search
- np hard
- random walk
- parallel machine scheduling problem
- online learning
- maximum lateness
- permutation flowshop
- distributed memory
- precedence constraints
- preventive maintenance
- real time
- shared memory
- parallel computing
- parallel processing
- learning algorithm
- completion times
- production line
- parallel implementation
- multistage
- special case