 A New and Efficient Heuristic To Solve the Multi-Product, Multi-Stage, Lot Sizing and Scheduling Problem in Flow ShopsJ. Ouenniche and F.F. Boctor Working Papers from Laval - Faculte des sciences de administration Abstract: 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. Keywords: PRODUCTION; DECISION MAKING (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:fth:lavadm:98-005 Access Statistics for this paper More papers in Working Papers from Laval - Faculte des sciences de administration Canada; Universite Laval, Faculte des sciences de l'administration. Pavillon des sciences de l'administration. Universite laval, Quebec, Canada G1K 7P4. Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.