The parallel machine scheduling problem with variable demand and a pre-defined lot size Online publication date: Sun, 11-Jan-2015
by Alex J. Ruiz-Torres; José Humberto Ablanedo-Rosas; Johnny C. Ho
International Journal of Operational Research (IJOR), Vol. 14, No. 1, 2012
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook