Hybrid methods for lot sizing on parallel machines
- 1 November 2015
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 63, 136-148
Abstract
No abstract availableKeywords
Funding Information
- Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) (2010/16727-9,2013/00965-6 and 2011/22647-0)
- Natural Sciences and Engineering Research Council of Canada (342182-09)
This publication has 40 references indexed in Scilit:
- A decomposition approach for the General Lotsizing and Scheduling Problem for Parallel production LinesEuropean Journal of Operational Research, 2013
- A fix-and-optimize approach for the multi-level capacitated lot sizing problemInternational Journal of Production Economics, 2010
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problemOptimization Methods and Software, 2009
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging companyAnnals of Operations Research, 2007
- An industrial extension of the discrete lot-sizing and scheduling problemIIE Transactions, 2004
- Computationally efficient solution of the multi-item, capacitated lot-sizing problemComputers & Industrial Engineering, 1995
- The performance of rolling production schedules in a process industryIIE Transactions, 1995
- Statistical search methods for lotsizing problemsAnnals of Operations Research, 1993
- Column Generation Based Heuristic Algorithm for Multi-Item SchedulingIIE Transactions, 1983
- Heuristic Procedures for the Single Operation, Multi-Item Loading ProblemA I I E Transactions, 1979