ISSN:
1432-5217
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract This paper deals with the problem of profit optimization in sawn timber production, utilizing a special type of sawmill. Expected rejects and resetting costs are taken into consideration. The present problem is formulated as a fixed charge linear programming problem involving identical fixed charges, one equality constraint and explicit bounds on the variables. Based on the greedy sorting of the variables we develop a branch-and-bound algorithm working on a special subset of all solutions. Through usage of the problem structure for constructing bounds we arrive at an acceptable CPU-time (on a 80386 personal computer) for practical purposes.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02331573
Permalink