A bicriteria approach to scheduling a single machine with job rejection and positional penalties.
Dvir ShabtayNufar GasparLiron YedidsionPublished in: J. Comb. Optim. (2012)
Keyphrases
- bicriteria
- single machine
- completion times
- scheduling problem
- flowshop
- maximum lateness
- release times
- release dates
- maximum tardiness
- single machine scheduling problem
- processing times
- minimize total
- sequence dependent setup times
- scheduling jobs
- total weighted tardiness
- setup times
- identical machines
- job processing times
- identical parallel machines
- deteriorating jobs
- parallel machines
- job shop
- competitive ratio
- minimizing makespan
- production scheduling
- precedence constraints
- efficient solutions
- job shop scheduling problem
- weighted number of tardy jobs
- weighted sum
- tabu search
- np hard
- integer linear programming
- dynamic programming
- queue length
- approximation algorithms
- knapsack problem
- computational complexity