A note on flow-shop and job-shop batch scheduling with identical processing-time jobs.
Gur MosheiovDaniel OronPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- completion times
- job shop
- flowshop
- scheduling problem
- open shop
- processing times
- single machine
- tabu search
- minimizing makespan
- total weighted tardiness
- setup times
- maximum lateness
- sequence dependent setup times
- total tardiness
- job shop scheduling
- special case
- asymptotic optimality
- np hard
- job shop scheduling problem
- unrelated parallel machines
- precedence constraints
- strongly np hard
- parallel machines
- permutation flowshop
- simulated annealing