Discrete lot streaming in two-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:22Z | |
| dc.date.available | 2014-06-17T20:41:22Z | |
| dc.date.created | 2013-12-23 | en_US |
| dc.date.issued | 1995-04 | en_US |
| dc.description | <p>22 leaves ; Includes bibliographical references (leaves 20-22). ; "April, 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 the two machine flowshop problem to minimize the makespan. We present new insights into the structure of optimal schedules, which lead to a strongly polynomial solution for the problem.</p> | en_US |
| dc.identifier.other | dsb/44 | en_US |
| dc.identifier.other | 1043 | en_US |
| dc.identifier.other | 4944064 | en_US |
| dc.identifier.uri | http://hdl.handle.net/11375/5585 | |
| dc.relation.ispartofseries | Research and working paper series (Michael G. DeGroote School of Business) | en_US |
| dc.relation.ispartofseries | no. 405 | en_US |
| dc.subject | Business | en_US |
| dc.subject | Business | en_US |
| dc.subject.lcc | Production scheduling > Mathematical models Programming (Mathematics) | en_US |
| dc.title | Discrete lot streaming in two-machine flow shops | en_US |
| dc.type | article | en_US |
Files
Original bundle
1 - 1 of 1