论文信息 - Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry

Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry

In this paper, we present an industrial problem found in a company that produces acrylic fibres to be used by the textile industry. The problem is a particular case of the discrete lot sizing and scheduling problem (DLSP). In this problem, lots of similar products must be generated and sequenced in ten unrelated parallel machines, in order to minimize tool changeovers and the quantity of fibre delivered after the required due date. The company problem is original because a changeover can occur between two lots of the same product due to tool wear. We analyse the problem in detail and present an adaptation of a heuristic found in the literature to solve it. Results obtained with the proposed heuristic are compared with results that used to be obtained by the production planner, using historical data.

Cristóvão Silva | José M. Magalhães

[1] Marc Salomon. The Discrete Lotsizing and Scheduling Problem (DLSP) , 1991 .

[2] Alf Kimms,et al. Lot sizing and scheduling -- Survey and extensions , 1997 .

[3] Marc Salomon,et al. Batching decisions: structure and models , 1994 .

[4] B. Fleischmann. The discrete lot-sizing and scheduling problem , 1990 .

[5] Klaus H. Ecker,et al. Scheduling Computer and Manufacturing Processes , 2001 .

[6] Andrea T.. Staggemeier,et al. A survey of lot-sizing and scheduling models , 2001 .

[7] L. V. Wassenhove,et al. Some extensions of the discrete lotsizing and scheduling problem , 1991 .

[8] Zhihui Xue,et al. Review of Scheduling computer and manufacturing processes by Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Guenter Schmidt, Jan Weglarz Springer-Verlag 2001 , 2003 .

[9] Mikhail Y. Kovalyov,et al. Heuristic algorithms for lotsize scheduling with application in the tobacco industry , 2001 .