The Production Switching Heuristic (PSH) developed by
Mellichamp and Love (1978) has been suggested as a more
realistic, practical and intuitively appealing approach to
aggregate production planning (APP). In this research, PSH
has been modified to present a more sophisticated open grid
search procedure for solving the APP problem. The
effectiveness of this approach has been demonstrated by
determining a better near-optimal solution to the classic
paint factory problem using a personal computer based
application written in THINK PASCAL. The performance of the
modified production switching heuristic is then compared in
the context of the paint factory problem with results
obtained by other prominent APP models including LDR, PPP,
and PSH to conclude that the modified PSH offers a better
minimum cost solution than the original PSH model. / Graduation date: 1992
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/36719 |
| Date | 05 June 1991 |
| Creators | Nam, Sang-jin |
| Contributors | Logendran, Rasaratnam |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0018 seconds