Lot streaming in flow shops

Simple item page
buir.advisorBenli, S. Ömer
dc.contributor.authorTopaloğlu, Engin
dc.date.accessioned2016-01-08T20:11:22Z
dc.date.available2016-01-08T20:11:22Z
dc.date.issued1994
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Deparment of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1994.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 1994.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.abstractLot streaming is permitting partial transfer of processed portions of a job to downstream machines, thus allowing ovelapping operations. The primary motivation is to improve the measures of performance by the quick movement of work in the shop. In this thesis, we study various forms of the lot streaming problem in flow shops to derive the characteristics of optimal solutions. We first analyze single job lot streaming problems, then extend the results to multi-job problems. When there is a single job, the lot streaming problem is to find the best transfer batch sizes that optimizes the given criterion. We consider three different measures of performance, job, sublot and item completion time criteria. We derive a closed form solution for a special case of job completion time criterion. Under sublot completion time criterion, when the first machine has the largest processing time, we show that partial transfers of equal size are optimal. We propose two polynomial time algorithms for the problem in which only two transfer batches are permitted between each consecutive machines for sublot and item completion time criteria. In multi-job lot streaming problems, the sequencing and lot streaming decisions must be considered simultaneously. For multi-job problems we investigate the hierarchical application of lot streaming and sequencing decisions.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityTopaloğlu, Enginen_US
dc.format.extentx, 85 leavesen_US
dc.identifier.urihttp://hdl.handle.net/11693/17556
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectSchedulingen_US
dc.subjectFlow Shopen_US
dc.subjectLot Streamingen_US
dc.subject.lccTS157.5 .T67 1994en_US
dc.subject.lcshScheduling (Management)--Mathematical models.en_US
dc.subject.lcshJob shops.en_US
dc.subject.lcshProduction scheduling.en_US
dc.titleLot streaming in flow shopsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B031339.pdf
Size:
3.27 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Dept. of Industrial Engineering - Master's degree