A new sufficient condition of optimality for the two-machine flowshop problem.
Cyril BriandHoang Trung LaJacques ErschlerPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- flowshop
- sufficient conditions
- asymptotic optimality
- scheduling problem
- special case
- sequence dependent setup times
- flowshop scheduling
- processing times
- minimizing total tardiness
- bicriteria
- minimizing makespan
- setup times
- maximum lateness
- single machine
- flowshop scheduling problems
- tabu search
- strongly np hard
- parallel machines
- precedence constraints
- lyapunov function
- robotic cell
- preventive maintenance
- job processing times
- learning algorithm
- permutation flowshop
- efficiently computable
- linear complementarity problem
- optimal policy
- exponential stability