Minimising makespan for two batch-processing machines with non-identical job sizes in job shop.
Bayi ChengShanlin YangYing MaPublished in: Int. J. Syst. Sci. (2012)
Keyphrases
- job shop
- batch processing machines
- maximum lateness
- scheduling problem
- flowshop
- single machine
- open shop
- job shop scheduling
- production scheduling
- precedence constraints
- tabu search
- sequence dependent setup times
- np hard
- parallel machines
- job shop scheduling problem
- release dates
- processing times
- setup times
- resource constrained
- special case
- neural network
- manufacturing systems
- metaheuristic