Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility.
Alex J. Ruiz-TorresJosé Humberto Ablanedo-RosasJohnny C. HoPublished in: Comput. Oper. Res. (2010)
Keyphrases
- number of tardy jobs
- flowshop
- processing times
- single machine
- resource consumption
- single machine scheduling problem
- scheduling problem
- special case
- release dates
- sequence dependent setup times
- bicriteria
- resource allocation
- maximum lateness
- flowshop scheduling
- flowshop scheduling problems
- tabu search
- minimizing makespan
- dynamic programming
- combinatorial optimization
- response time
- solution quality
- knapsack problem