The focuses of this dissertation are problems of batch production scheduling problems for perishable products with setup times, with the main applications in answering production planning problems faced by manufacturers of perishable products, such as beers, vaccines and yoghurts. The benefits of effective production plans can help companies reduce their total costs substantially to gain the competitive advantages without reduction of the service level in a globalize economy.
We develop concepts and methodologies that are applied in two fundamental
problems: (i) the batch production scheduling problem for perishable products with sequence-independent setup times (BPP-SI) and (ii) the batch production scheduling problem for perishable products with sequence-dependent setup times (BPP-SD).
The problem is that given a set of forecast demand for perishables products to be produced by a set of parallel machines in the single stage of batch production, with each product having fixed shelf-life times and each machine requiring setup times before producing a batch of product, find the master production schedule which minimizes total cost over a specified time horizon. We present the new models for both problems by formulating them as a Mixed Integer Program (MIP) on the discrete time. Computational studies in BPP-SI and BPP-SD for industrial problems are presented. In order to efficiently solve the large BPP-SI problems in practice, we develop the five efficient heuristics. The extensive computational results show that the developed heuristics can obtain the good solution for the very large problem size and require very short amount of computational time.
| Identifer | oai:union.ndltd.org:GATECH/oai:smartech.gatech.edu:1853/14571 |
| Date | 16 January 2007 |
| Creators | Charnprasitphon, Aphiwat |
| Publisher | Georgia Institute of Technology |
| Source Sets | Georgia Tech Electronic Thesis and Dissertation Archive |
| Detected Language | English |
| Type | Dissertation |
Page generated in 0.0018 seconds