Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion.
Adam KasperskiPublished in: Oper. Res. Lett. (2005)
Keyphrases
- data transfer
- single machine
- maximum lateness
- weighted number of tardy jobs
- scheduling problem
- completion times
- processing times
- total weighted tardiness
- release dates
- sequence dependent setup times
- precedence constraints
- release times
- dynamic programming
- worst case
- deteriorating jobs
- lower bound
- np hard
- single machine scheduling problem
- flowshop
- multistage
- linear programming
- upper bound