Scheduling hybrid flowshop with sequence-dependent setup times and due windows to minimize total weighted earliness and tardiness.
Ankit KhareSunil AgrawalPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- sequence dependent setup times
- minimize total
- single machine
- release dates
- scheduling problem
- flowshop
- parallel machines
- weighted tardiness
- maximum lateness
- single machine scheduling problem
- processing times
- precedence constraints
- setup times
- np hard
- dynamic programming
- tabu search
- branch and bound algorithm
- special case
- total cost
- optimal solution
- lot sizing
- parallel computing
- single server
- search space
- search algorithm