haku: @indexterm NONLINEAR PROGRAMMING / yhteensä: 122
viite: 10 / 122
Tekijä:Ouenniche, J.
Boctor, F. F.
Otsikko:The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops
Lehti:European Journal of Operational Research
2001 : MAR 16, VOL. 129:3, p. 539-554
Asiasana:SEQUENTIAL ANALYSIS
NONLINEAR PROGRAMMING
HEURISTIC METHODS
SCHEDULING
Kieli:eng
Tiivistelmä:This paper presents a new efficient heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops. The problem addressed is that of making sequencing, lot sizing and scheduling decisions for a number of products so as to minimize the sum of setup costs, work-in-process inventory holding costs and final- products inventory holding costs while a given demand is fulfilled without backlogging. The proposed heuristic, called the two-group method (TG), assumes that the cycle time of each product is an integer multiple of a basic period and restricts these multiples to take either the value 1 or K where K is a positive integer.
SCIMA tietueen numero: 224584
lisää koriin
SCIMA