The parallel machine scheduling problem with variable demand and a pre-defined lot size

Alex J. Ruiz-Torres, José Humberto Ablanedo-Rosas and Johnny C. Ho

International Journal of Operational Research, 2012, vol. 14, issue 1, 1-30

Abstract: In this paper, we consider the problem of scheduling multiple product types in parallel machines given variable demand across a multi-period planning horizon. Production is organised around a pre-defined lot size as frequently arises in the pharmaceutical industry. The problem class falls within the big bucket category with a single level of production, it is capacitated and considers multiple parallel machines. There is no deterioration of the items within the planning horizon, the demand is dynamic and deterministic. A complex set-up structure is assumed, and backordering is allowed. The objective is to find a production schedule that minimises holding, setup and backordering costs. Four heuristics are developed to generate the production plan. Computational experiments demonstrate that the solutions generated are close to optimal for small problems, and that the methods have robust performance for larger problems.

Keywords: production planning; parallel machine scheduling; lot sizing; heuristics; pharmaceutical industry. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=46341 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:14:y:2012:i:1:p:1-30

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().