Title:
Modeling and Analysis of the Batch Production Scheduling Problem for Perishable Products with Setup Times

dc.contributor.advisor Al-Khayyal, Faiz
dc.contributor.advisor Griffin, Paul
dc.contributor.author Charnprasitphon, Aphiwat en_US
dc.contributor.committeeMember Barnes, Earl R.
dc.contributor.committeeMember Elton, John
dc.contributor.committeeMember Lu, Jye-Chyi
dc.contributor.department Industrial and Systems Engineering en_US
dc.date.accessioned 2007-05-25T17:33:48Z
dc.date.available 2007-05-25T17:33:48Z
dc.date.issued 2007-01-16 en_US
dc.description.abstract 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. en_US
dc.description.degree Ph.D. en_US
dc.identifier.uri http://hdl.handle.net/1853/14571
dc.publisher Georgia Institute of Technology en_US
dc.subject Lot-sizing en_US
dc.subject Perishable products en_US
dc.subject Setup times en_US
dc.subject Batch production en_US
dc.subject Production scheduling en_US
dc.subject.lcsh Production scheduling en_US
dc.subject.lcsh Perishable goods Production control en_US
dc.title Modeling and Analysis of the Batch Production Scheduling Problem for Perishable Products with Setup Times en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.corporatename H. Milton Stewart School of Industrial and Systems Engineering
local.contributor.corporatename College of Engineering
relation.isOrgUnitOfPublication 29ad75f0-242d-49a7-9b3d-0ac88893323c
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
aphiwat_charnprasitphon_200705__phd.pdf
Size:
761.95 KB
Format:
Adobe Portable Document Format
Description: