|
Manne (1960)
|
Scheduling |
- |
Minimize the makespan |
|
Sousa & Wolsey (1992)
|
Scheduling |
Cutting plane/Branch and Bound algorithm |
Minimize costs/Maximize profits |
|
Tavares (2002)
|
Scheduling |
- |
- |
|
Araujo et al. (2004)
|
Integrated Lot Sizing and Scheduling |
Local Search Algorithm |
Minimize inventory costs, backorder and setup costs |
|
Leung (2004)
|
Scheduling |
- |
- |
|
Toso & Morabito (2005)
|
Integrated Lot Sizing and Scheduling |
Relax-and-fix heuristic |
Minimize inventory costs and overtime costs |
|
Carvalho & Santos (2006)
|
Integrated Lot Sizing and Scheduling |
Branch and Bound |
Minimize setup costs |
|
Brahimi et al. (2006)
|
Lot Sizing |
- |
Minimize production costs, setup costs, inventory holding costs and backlogging costs |
|
Santos (2006)
|
Integrated Lot Sizing and Scheduling |
Branch and Bound |
Minimize setup costs |
|
Araujo et al. (2007)
|
Integrated Lot Sizing and Scheduling |
Relax-and-fix heuristic/Local Search Algorithm |
Minimize a penalty-weighted sum of product backlogs, finished inventories and setup changeovers |
|
Bustamante (2007)
|
Scheduling |
Branch and Bound |
Minimize the sum of earliness and tardiness costs |
|
Yamashita & Morabito (2007)
|
Scheduling |
Branch and Bound |
Minimize total cost allocation of project resources |
|
Toledo et al. (2007)
|
Integrated Lot Sizing and Scheduling |
Branch and Cut/Linear Relaxation |
Minimize production costs, setup costs and inventory holding costs |
|
Allahverdi et al. (2008)
|
Scheduling |
- |
Minimize setup costs |
|
Chen & Askin (2009)
|
Scheduling |
Implicit enumeration algorithm |
Maximize profits |
|
Ferreira et al. (2009)
|
Integrated Lot Sizing and Scheduling |
Relax-and-fix heuristic |
Minimize the total sum of product inventory, demand backorder, machine changeover and tank changeover costs |
|
Toso et al. (2009)
|
Integrated Lot Sizing and Scheduling |
Relax-and-fix heuristic |
Minimize the costs of inventory, overtime and setup costs |
|
Bernardes et al. (2010)
|
Integrated Lot Sizing and Scheduling |
Branch and Cut |
Minimize inventory costs, backorder and setup costs |
|
Stadtler (2010)
|
Integrated Lot Sizing and Scheduling |
Branch and Bound |
Minimize inventory costs and setup costs |
|
Henriques et al. (2010)
|
Integrated Lot Sizing and Scheduling |
Branch and Bound |
Minimize inventory costs |
|
Ferreira et al. (2010)
|
Integrated Lot Sizing and Scheduling |
Relax-and-fix heuristic |
Minimize the total sum of the inventory, backorder and machine changeover costs |
|
Defalque et al. (2011)
|
Integrated Lot Sizing and Scheduling |
Branch and Cut |
Minimize inventory costs, backorder and setup costs |
|
Clark et al. (2011)
|
Integrated Lot Sizing and Scheduling |
- |
- |
|
Ramos & Oliveira (2011)
|
Scheduling |
Hybrid evolutionary algorithm |
Minimize the sum of earliness and tardiness costs |
|
Shim et al. (2011)
|
Integrated Lot Sizing and Scheduling |
Adapted heuristic |
Minimize the sum of setup and inventory holding costs |
|
Stadtler & Sahling (2012)
|
Integrated Lot Sizing and Scheduling |
Relax-and-fix/Relax-and-optimize heuristics |
Minimize inventory holding costs, setup costs and penalty costs for backorders |
|
Pinedo (2012)
|
Scheduling |
- |
- |
|
Rego (2013)
|
Scheduling |
Multi-objective algorithms |
Minimize makespan and total weighted lateness |
|
Molina et al. (2013)
|
Lot Sizing |
Modified Lagrangian Relaxation |
Minimize inventory holding costs, backorder, setup costs and transportation costs |
|
Seeanner & Meyr (2013)
|
Integrated Lot Sizing and Scheduling |
Relax-and-fix/LP-and-fix heuristics |
Minimize the sum of inventory holding costs, setup costs, production costs, costs for standby, external purchase, overtime and holding of Work-In-Progress stock |