Publications
Detailed Information
Transfer Batch Scheduling for a Two-stage Flowshop with Identical Parallel Machines At Each Stage
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, J-S | - |
| dc.contributor.author | Kang, Suk-Ho | - |
| dc.contributor.author | Lee, SM | - |
| dc.date.accessioned | 2009-08-24T07:00:51Z | - |
| dc.date.available | 2009-08-24T07:00:51Z | - |
| dc.date.issued | 1997-10 | - |
| dc.identifier.citation | Omega, 1997, 25, 547 | en |
| dc.identifier.issn | 0305-0483 | - |
| dc.identifier.uri | https://hdl.handle.net/10371/7587 | - |
| dc.description.abstract | This paper considers the transfer batch scheduling problem for a two-stage flowshop with identical
parallel machines at each stage. Two cases of separable and inseparable setup times and processing times are examined. A scheduling rule similar to Johnson's rule is suggested to minimize makespan. The scheduling method developed in this paper subsumes many existing methods for two-stage flowshop makespan minimization. A numerical example is presented to illustrate the scheduling method. | en |
| dc.language.iso | en | - |
| dc.publisher | Elsevier | en |
| dc.subject | two-stage flexible flowshop | en |
| dc.subject | transfer batch schedulin | en |
| dc.subject | makespan | en |
| dc.title | Transfer Batch Scheduling for a Two-stage Flowshop with Identical Parallel Machines At Each Stage | en |
| dc.type | Article | en |
| dc.contributor.AlternativeAuthor | 강석호 | - |
| dc.identifier.doi | 10.1016/S0305-0483(97)00015-7 | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.