Skip to main content

Multi-product lot sizing and scheduling on unrelated parallel machines

Buy Article:

$63.00 plus tax (Refund Policy)

This article studies a problem of optimal scheduling and lot sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence-dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time at which all the demands are satisfied, Cmax, or the maximum lateness of the product completion times from the given due dates, Lmax. The problem is motivated by the real-life scheduling applications in multi-product plants. The properties of optimal solutions, NP-hardness proofs, enumeration, and dynamic programming algorithms for various special cases of the problem are presented. A greedy-type heuristic is proposed and experimentally tested. The major contributions are an NP-hardness proof, pseudo-polynomial algorithms linear in m for the case, in which the number of products is a given constant and the heuristic. The results can be adapted for solving a production line design problem.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Data/Media
No Metrics

Keywords: Scheduling; lot sizing; parallel machines; production line design

Document Type: Research Article

Affiliations: 1: Industrial Engineering and Computer Science Research Center, Ecole des Mines de Saint-Etienne, Saint-Etienne, Cedex 2, France 2: Omsk Branch of Sobolev Institute of Mathematics SB RAS, Omsk, Russia 3: United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus 4: Institute of Mathematics and Information Technologies, Omsk State University, Omsk, Russia

Publication date: 2010-07-01

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more