Back to search

McMaster University

Lot Streaming Schedules in Flow Shops

Abstract

dc:description.abstract

<p>Lot streaming is the process of splitting a job or lot to allow overlapping between successive operations in a multistage system. The use of transfer lots usually results in a shorter makespan and lower work-in-process inventory than without it.</p> <p>In the thesis, we first study the discrete version of schedules which minimize the makespan for a single job in two- and three- machine flow shops. The optimal solution on s sublots can be obtained in O(s) time for the two-machine problem. We also present the first polynomial time solution for the three-machine problem. Two very good quality approximations for the discrete lot streaming solution in m-machine flow shops are also presented.</p> <p>Other topics studied are the effect of setups (either detached or attached) on continuous lot streaming for three-machine flow shops. We show that, in most cases, the optimal schedule and its structure change substantially in comparison with the no setup case. In the presence of either detached or attached setups, the three-machine flow shop problem on s sublots can be solved in O(s) time.</p>

Degree

thesis:*
Department dc:contributor.department
Business Administration
Year dc:date.issued
1995

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chen, Jiang
Advisor dc:contributor.advisor
  • Steiner, George

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/2262
3292
1372568

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Chen, Jiang. Lot Streaming Schedules in Flow Shops. 1995. http://hdl.handle.net/11375/6960