Graeme Warren
2012 South African Journal of Industrial Engineering  
This paper examines the sub-optimality of generalized greedy heuristics for solut ion of a certain well-known production mix problem formulation . The drawbacks of not modelling routing in the mix problem formulation are discussed, and an alternati ve mix prob lem formulation (with assoc iated solution strategies) is proposed . OPSOMN1ING Hierdie artikel verduidelik die sub-optirnaliteit van ' n algemene gulsige heuristiek vir 'n sekere bekende produkmengsel probleemformulering. Die nadele van
more » ... ng. Die nadele van weglating van produk roete inligting in die formulering is bespreek, en ' n alternatiewe formulering (met geassosieerde oplossingsstrategiee) is voorgestel. When constraint set (4) is relaxed to Xi E 91 + Vi we call the resultant program the relaxed PMP . The relaxed PMP is a linear program (LP). The work of Goldratt [9,10] on the " theory of constraints" has increased general awareness of the product mix problem in the last several decades. The theory of constraints (TOC) holds that production environments can be effectivel y managed by identifying and managing constraining bottleneck workstations, and has served to popularise some well-known basic results from queueing theory among production management professionals. One of the key issues in constraint-based production management is the identification of bottleneck 108
doi:10.7166/12-2-351 fatcat:jdvw3jdcijejhdehsocevqdhcu