Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1227
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Lin, BMT | - |
dc.creator | Cheng, TCE | - |
dc.creator | Chou, ASC | - |
dc.date.accessioned | 2014-12-11T08:23:35Z | - |
dc.date.available | 2014-12-11T08:23:35Z | - |
dc.identifier.issn | 0305-0483 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1227 | - |
dc.language.iso | en | en_US |
dc.publisher | Pergamon Press | en_US |
dc.rights | Omega © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Two-stage flowshop | en_US |
dc.subject | Batch scheduling | en_US |
dc.subject | Makespan | en_US |
dc.subject | NP-hardness | en_US |
dc.subject | Heuristics | en_US |
dc.title | Scheduling in an assembly-type production chain with batch transfer | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: T. C. E. Cheng | en_US |
dc.identifier.spage | 143 | - |
dc.identifier.epage | 151 | - |
dc.identifier.volume | 35 | - |
dc.identifier.issue | 2 | - |
dc.identifier.doi | 10.1016/j.omega.2005.04.004 | - |
dcterms.abstract | This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second stage of a flowshop for processing the component parts in batches. Whenever a batch is formed on the second-stage machine, a constant setup time is required. The objective is to minimize the makespan. In this study we establish the strong NP-hardness of the problem for the case where all the jobs have the same processing time on the second-stage machine. We then explore a useful property, based upon which a special case can be optimally solved in polynomial time. We also study several heuristic algorithms to generate quality approximate solutions for the general problem. Computational experiments are conducted to evaluate the effectiveness of the algorithms. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Omega, Apr. 2007, v.35, no. 2, p. 143-151 | - |
dcterms.isPartOf | Omega | - |
dcterms.issued | 2007-04 | - |
dc.identifier.isi | WOS:000241089300002 | - |
dc.identifier.scopus | 2-s2.0-33748265082 | - |
dc.identifier.eissn | 1873-5274 | - |
dc.identifier.rosgroupid | r34063 | - |
dc.description.ros | 2006-2007 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
LIN_CHENG_CHOU_0327_LIB.pdf | Pre-published version | 239.1 kB | Adobe PDF | View/Open |
Page views
162
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
233
Citations as of Oct 13, 2024
SCOPUSTM
Citations
35
Last Week
0
0
Last month
0
0
Citations as of Oct 17, 2024
WEB OF SCIENCETM
Citations
33
Last Week
0
0
Last month
0
0
Citations as of Oct 17, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.