An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives.
Christian ArtiguesNicolas JozefowiezMohamed Ali AloulouPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- setup cost
- sequence dependent setup times
- maximum lateness
- bi objective
- multiple objectives
- lot sizing
- multi objective
- flowshop
- efficient solutions
- lead time
- production planning
- total cost
- production cost
- multi item
- parallel machines
- multi objective optimization
- knapsack problem
- ant colony optimization
- network design
- asymptotically optimal
- holding cost
- long run
- single machine
- state dependent
- special case
- scheduling problem
- release dates
- multistage
- optimal solution
- single item
- precedence constraints
- integer programming
- objective function