Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines
by Carina Pimentel, Filipe Pereira Alvelos, Antonio Duarte, Jose M. Valerio de Carvalho
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 22, No. 1, 2011

Abstract: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled from, a list of components. During production, each component can be split into one or several lots of different sizes and each lot will be produced independently on one of a group of identical parallel machines. We formulate the problem into a mixed integer programming model and develop a heuristic method to solve the model. The heuristic method is based on a network flow model with the objective to minimise the weighted sum of the total tardiness of products and the deviations occurred during production of each product. The deviation of a product is measured by the deviation of product completion time (the last component lot completion time) and completion time of the rest of components lots for the same product. We present computational results and performance measures of the network flow heuristic for a set of randomly generated instances based on real world data.

Online publication date: Thu, 27-Nov-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Manufacturing Technology and Management (IJMTM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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