Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems.
Tao RenYuandong DiaoXiaochuan LuoPublished in: J. Appl. Math. (2012)
Keyphrases
- scheduling problem
- numerical simulations
- flowshop
- theoretical analysis
- buffer allocation
- single machine
- np hard
- asymptotic optimality
- strongly np hard
- sequence dependent setup times
- tabu search
- total tardiness
- setup times
- maximum lateness
- makespan minimization
- precedence constraints
- processing times
- optimal solution
- job shop scheduling problem
- special case
- job shop
- parallel machines
- flowshop scheduling
- job shop scheduling
- permutation flowshop
- total weighted tardiness
- optimal control
- open shop
- minimizing makespan
- dynamic programming
- particle swarm optimization
- lot streaming