Approximation methods for discrete lot streaming in 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:28Z | |
| dc.date.available | 2014-06-17T20:41:28Z | |
| dc.date.created | 2013-12-23 | en_US |
| dc.date.issued | 1995-06 | en_US |
| dc.description | <p>12 leaves ; Includes bibliographical references (leaves 10-12). ; "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 shorter makespan for the corresponding schedule. In this paper, we present two quickly obtainable approximations of very good quality for the discrete lot streaming problem in flow shops.</p> | en_US |
| dc.identifier.other | dsb/46 | en_US |
| dc.identifier.other | 1045 | en_US |
| dc.identifier.other | 4944066 | en_US |
| dc.identifier.uri | http://hdl.handle.net/11375/5587 | |
| dc.relation.ispartofseries | Research and working paper series (Michael G. DeGroote School of Business) | en_US |
| dc.relation.ispartofseries | no. 410 | en_US |
| dc.subject | Business | en_US |
| dc.subject | Business | en_US |
| dc.subject.lcc | Production scheduling > Mathematical models Economic lot size > Mathematical models Programming (Mathematics) Mathematical optimization | en_US |
| dc.title | Approximation methods for discrete lot streaming in flow shops | en_US |
| dc.type | article | en_US |
Files
Original bundle
1 - 1 of 1