An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness.
Jeffrey E. SchallerJorge M. S. ValentePublished in: J. Oper. Res. Soc. (2013)
Keyphrases
- minimize total
- scheduling problem
- single machine
- flowshop
- parallel machines
- release dates
- sequence dependent setup times
- weighted tardiness
- maximum lateness
- unrelated parallel machines
- processing times
- setup times
- precedence constraints
- flowshop scheduling problems
- single machine scheduling problem
- total cost
- tabu search
- np hard
- special case
- job shop scheduling problem
- job shop
- completion times
- production scheduling
- search algorithm
- parallel computing
- approximation algorithms
- evolutionary algorithm