IDEAS home Printed from
   My bibliography  Save this paper

A New and Efficient Heuristic To Solve the Multi-Product, Multi-Stage, Lot Sizing and Scheduling Problem in Flow Shops


  • Ouenniche, J.
  • Boctor, F.F.


This paper presents a new and efficient heuristic to solve the multi-product, multi-stage, sequencing, lot sizing and scheduling problem. The problem addressed is that of making sequencing, lot sizing and scheduling decisions for a number of products manufactured through several stages in a flow shop environment, so as to minimze the sum of setup and inventory holding costs while a given demand is fulfilled without backlogging. The proposed solution method, called the multiple cycle scheduling heuristic, assumes that the cycle time of each product is an integer multiple of a basic period. Once time multipliers are chosen, we calculate the basic period value and determine for each basic period of the global cycle the set of products to be produced and the production sequence to be used. Then a linear program is solved to determine the optimal schedule for the chosen multipliers, basic period and production sequence.

Suggested Citation

  • Ouenniche, J. & Boctor, F.F., 1998. "A New and Efficient Heuristic To Solve the Multi-Product, Multi-Stage, Lot Sizing and Scheduling Problem in Flow Shops," Papers 98-005, Laval - Faculte des sciences de administration.
  • Handle: RePEc:fth:lavadm:98-005

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item



    JEL classification:

    • D20 - Microeconomics - - Production and Organizations - - - General
    • D21 - Microeconomics - - Production and Organizations - - - Firm Behavior: Theory


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:fth:lavadm:98-005. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.