A new lower bound approach for single-machine multicriteria scheduling.
J. A. HoogeveenSteef L. van de VeldePublished in: Oper. Res. Lett. (1992)
Keyphrases
- single machine
- scheduling problem
- lower bound
- competitive ratio
- dominance rules
- minimize total
- release dates
- maximum lateness
- np hard
- release times
- scheduling jobs
- weighted tardiness
- sequence dependent setup times
- processing times
- upper bound
- identical parallel machines
- earliness tardiness
- total weighted tardiness
- branch and bound algorithm
- production scheduling
- total tardiness
- setup times
- rolling horizon
- deteriorating jobs
- identical machines
- precedence constraints
- single machine scheduling problem
- parallel machines
- optimal solution
- job shop scheduling
- flowshop
- job processing times
- decision problems
- number of late jobs
- lower and upper bounds
- learning effect
- worst case
- strongly np hard
- dynamic programming
- job shop scheduling problem
- objective function
- tabu search
- scheduling algorithm
- resource allocation
- approximation algorithms
- completion times