Minimising makespan in job-shops with deterministic machine availability constraints.
Shih-Wei LinKuo-Ching YingPublished in: Int. J. Prod. Res. (2021)
Keyphrases
- flowshop
- batch processing
- scheduling problem
- scheduling jobs
- processing times
- lot streaming
- special case
- bicriteria
- maximum lateness
- parallel machines
- parallel machine scheduling problem
- release dates
- unrelated parallel machines
- completion times
- job processing times
- minimizing makespan
- constraint satisfaction
- single machine
- precedence constraints
- tabu search
- sequence dependent setup times
- setup times
- global constraints
- strongly np hard
- optimal solution
- asymptotic optimality
- linear constraints
- constrained optimization
- total weighted tardiness
- identical machines
- job shop
- harmony search algorithm
- black box
- constraint programming
- production system
- neural network
- single machine scheduling problem
- genetic algorithm