Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work.
Rubing ChenYuan GaoZhichao GengJinjiang YuanPublished in: Int. J. Prod. Res. (2023)
Keyphrases
- minimize total
- single machine
- scheduling problem
- processing times
- release dates
- parallel machines
- completion times
- weighted tardiness
- flowshop
- sequence dependent setup times
- setup times
- np hard
- precedence constraints
- tabu search
- single machine scheduling problem
- resource consumption
- job shop scheduling problem
- evolutionary algorithm