Placeholder text

Lower Bounding the Capacitated Lot Size Problem (Classic Reprint)

Lower Bounding the Capacitated Lot Size Problem (Classic Reprint)

0 - Default Title
Description
Excerpt from Lower Bounding the Capacitated Lot Size Problem<br/><br/>The capacitated lot size problem (clsp) concerns the attempt to schedule in detail while taking aggregate resource constraints into consideration. Aggregate resource management under changing demand has been researched thoroughly (1) (12) (14) (16) (26) (27) as has the uncapacitated lot size problem under various assumptions of stationarity, costs and problem size (2) (5) (13) (18) (22) (24) However, the existence of a fixed charge has precluded effective solution of the combined problem. Strictly heuristic procedures (21) and strong approxi mations (8) now exist. However, the degree of their success is dependent upon the problem  configuration.
Product details
Binding:
Paperback
Number of Pages:
78
Release Date:
2018-09-08
Publication Date:
2018-09-08
Publisher:
Forgotten Books
Languages:
Published: English, Original: English
ISBN10:
1390505677
Weight:
118 g
Currently sold out