Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop.
Shih-Wei LinChung-Cheng Jason LuKuo-Ching YingPublished in: IEEE Access (2018)
Keyphrases
- total weighted tardiness
- flowshop
- completion times
- scheduling problem
- sequence dependent setup times
- single machine
- processing times
- bicriteria
- makespan minimization
- special case
- setup times
- tabu search
- maximum lateness
- minimizing makespan
- parallel machines
- job shop
- lot streaming
- job shop scheduling problem
- strongly np hard
- release dates
- flowshop scheduling problems
- permutation flowshop
- precedence constraints
- dynamic programming
- polynomially solvable
- hybrid algorithm