Discrete lot streaming in three-machine flow shops
| dc.contributor.author | Chen, Jiang | en_US |
| dc.contributor.author | Steiner, George | en_US |
| dc.contributor.author | McMaster University, Michael G. DeGroote School of Business | en_US |
| dc.date.accessioned | 2014-06-17T20:41:16Z | |
| dc.date.available | 2014-06-17T20:41:16Z | |
| dc.date.created | 2013-12-23 | en_US |
| dc.date.issued | 1995-06 | en_US |
| dc.description | <p>30 leaves : ; Includes bibliographical references (leaves 28-30). ; "June, 1995.";</p> <p>This research was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant No.OGP0001798.</p> | en_US |
| dc.description.abstract | <p>Lot streaming is the process of splitting a job or lot to allow overlapping between successive operations in a multistage production system. This use of transfer lots usually results in a substantially shorter makespan for the corresponding schedule. In this paper, we study the discrete version of schedules which minimize the makespan for a single job in a three-machine flow shop. We present new insights into the structure of optimal schedules, which lead to the first polynomial time solution of the problem.</p> | en_US |
| dc.identifier.other | dsb/45 | en_US |
| dc.identifier.other | 1044 | en_US |
| dc.identifier.other | 4944065 | en_US |
| dc.identifier.uri | http://hdl.handle.net/11375/5586 | |
| dc.relation.ispartofseries | Research and working paper series (Michael G. DeGroote School of Business) | en_US |
| dc.relation.ispartofseries | no. 412 | en_US |
| dc.subject | Business | en_US |
| dc.subject | Business | en_US |
| dc.subject.lcc | Economic lot size > Mathematical models Production scheduling > Mathematical models Mathematical optimization Algorithms | en_US |
| dc.title | Discrete lot streaming in three-machine flow shops | en_US |
| dc.type | article | en_US |
Files
Original bundle
1 - 1 of 1