On heuristic solutions for the stochastic flowshop scheduling problem.
Jose M. FramiñanPaz Perez-GonzalezPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- flowshop
- scheduling problem
- minimizing makespan
- flowshop scheduling
- single machine
- processing times
- total flowtime
- setup times
- bicriteria
- sequence dependent setup times
- np hard
- minimizing total tardiness
- permutation flowshop
- total tardiness
- parallel machines
- special case
- makespan minimization
- maximum lateness
- tabu search
- total weighted tardiness
- flowshop scheduling problems
- unrelated parallel machines
- maximum tardiness
- job shop scheduling problem
- preventive maintenance
- job processing times
- strongly np hard
- computational complexity
- upper bound
- optimal solution
- multistage
- precedence constraints
- neural network