Permutation flowshop scheduling problems with maximal and minimal time lags.
Julien FondrevelleAmmar OulamaraMarie-Claude PortmannPublished in: Comput. Oper. Res. (2006)
Keyphrases
- scheduling problem
- permutation flowshop
- total flowtime
- single machine
- flowshop
- setup times
- precedence constraints
- processing times
- np hard
- strongly np hard
- minimal length
- tabu search
- job shop
- parallel machines
- search space
- upper bound
- job shop scheduling problem
- feasible solution
- np complete
- markov chain
- response time
- supply chain
- minimizing makespan
- computational complexity
- integer points