Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates.
Dirk BiskupMartin FeldmannPublished in: Comput. Oper. Res. (2001)
Keyphrases
- single machine
- processing times
- scheduling problem
- release dates
- minimize total
- scheduling jobs
- release times
- maximum lateness
- identical machines
- weighted tardiness
- sequence dependent setup times
- total weighted tardiness
- setup times
- earliness tardiness
- deteriorating jobs
- identical parallel machines
- production scheduling
- rolling horizon
- single machine scheduling problem
- total tardiness
- learning effect
- precedence constraints
- job shop scheduling
- competitive ratio
- parallel machines
- flowshop
- number of late jobs
- job processing times
- completion times
- np hard
- job shop
- tabu search
- dynamic programming
- resource consumption
- weighted number of tardy jobs
- job shop scheduling problem
- linear programming
- special case
- evolutionary algorithm
- lower bound