Dominance-based heuristics for one-machine total cost scheduling problems.
Antoine JougletDavid SavoureyJacques CarlierPhilippe BaptistePublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- total cost
- scheduling problem
- flowshop
- greedy heuristics
- list scheduling
- parallel machines
- optimal solution
- processing times
- sequence dependent setup times
- single machine
- np hard
- maximum lateness
- minimum total cost
- opportunity cost
- job shop scheduling problem
- service level
- multi period
- planning horizon
- setup cost
- objective function
- holding cost
- precedence constraints
- special case
- lead time
- lot size
- inventory level
- production cost
- fixed cost
- release dates
- search algorithm
- tabu search