Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem.
Sedighe ArabameriNasser SalmasiPublished in: Comput. Ind. Eng. (2013)
Keyphrases
- sequence dependent setup times
- flowshop
- scheduling problem
- minimizing total tardiness
- setup times
- single machine
- total weighted tardiness
- maximum lateness
- completion times
- processing times
- total tardiness
- parallel machines
- minimizing makespan
- np hard
- precedence constraints
- special case
- makespan minimization
- tabu search
- permutation flowshop
- job shop scheduling problem
- release dates
- steady state
- job shop
- preventive maintenance
- strongly np hard
- supply chain
- weighted sum