Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/650
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorWang, X-
dc.creatorCheng, TCE-
dc.date.accessioned2014-12-11T08:27:37Z-
dc.date.available2014-12-11T08:27:37Z-
dc.identifier.issn0305-0548-
dc.identifier.urihttp://hdl.handle.net/10397/650-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rightsComputers & Operations Research © 2004 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectFlowshop schedulingen_US
dc.subjectJob class setupsen_US
dc.subjectNo-waiten_US
dc.subjectHeuristicen_US
dc.subjectMaximum latenessen_US
dc.titleA heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setupsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage1326-
dc.identifier.epage1344-
dc.identifier.volume33-
dc.identifier.issue5-
dc.identifier.doi10.1016/j.cor.2004.09.018-
dcterms.abstractThis paper studies the two-machine flowshop scheduling problem with class setups in a no-wait processing environment to minimize the maximum lateness. The jobs are divided into job classes and a setup is required at the initial processing of a job or between the processing of jobs of different classes. In a no-wait environment, a job must be processed from start to finish without interruptions on a machine or between the machines. A batch is a maximal subset of consecutively processed jobs of the same class. Several properties concerning the beneficial merging of batches and some dominance rules that improve the objective function are derived. Since the problem is NP-hard, a heuristic is proposed and evaluated computationally. The numerical results demonstrate that the heuristic can produce near-optimal solutions quickly for realistic-sized problems.-
dcterms.bibliographicCitationComputers and operations research, May 2006, v. 33, no. 5, p. 1326-1344-
dcterms.isPartOfComputers and operations research-
dcterms.issued2006-05-
dc.identifier.isiWOS:000233470800011-
dc.identifier.scopus2-s2.0-26444474118-
dc.identifier.eissn1873-765X-
dc.identifier.rosgroupidr27805-
dc.description.ros2005-2006 > Academic research: refereed > Publication in refereed journal-
dc.description.oapreprint_postprint-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
AheuristicApproachForNo_waitFlowshop.pdfPre-published version491.23 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show simple item record
PIRA download icon_1.1View/Download Full Text

SCOPUSTM   
Citations

21
Last Week
0
Last month
0
Citations as of Aug 24, 2020

WEB OF SCIENCETM
Citations

17
Last Week
0
Last month
0
Citations as of Oct 27, 2020

Page view(s)

438
Last Week
0
Last month
Citations as of Oct 25, 2020

Download(s)

402
Citations as of Oct 25, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.