Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed.
Jeffrey E. SchallerJorge M. S. ValentePublished in: Expert Syst. Appl. (2019)
Keyphrases
- scheduling jobs
- single machine
- scheduling problem
- flowshop
- release dates
- sequence dependent setup times
- processing times
- parallel machines
- setup times
- single machine scheduling problem
- precedence constraints
- np hard
- completion times
- search algorithm
- tabu search
- identical parallel machines
- markov chain
- linear programming
- special case
- lower bound