A New and Efficient Heuristic To Solve the Multi-Product, Multi-Stage, Lot Sizing and Scheduling Problem in Flow Shops
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.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" 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.
|Date of creation:||1998|
|Date of revision:|
|Contact details of provider:|| Postal: Canada; Universite Laval, Faculte des sciences de l'administration. Pavillon des sciences de l'administration. Universite laval, Quebec, Canada G1K 7P4|
Phone: (418) 656-2180
Web page: http://www.fsa.ulaval.ca/
More information through EDIRC
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)
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.