Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1269
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorAllahverdi, A-
dc.creatorNg, CTD-
dc.creatorCheng, TCE-
dc.creatorKovalyov, MY-
dc.date.accessioned2014-12-11T08:24:01Z-
dc.date.available2014-12-11T08:24:01Z-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/10397/1269-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsEuropean Journal of Operational Research © 2006 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectSetup timeen_US
dc.subjectSetup costen_US
dc.subjectSurvey (review)en_US
dc.subjectSingle machineen_US
dc.subjectParallel machinesen_US
dc.subjectFlow shopen_US
dc.subjectJob shopen_US
dc.subjectOpen shopen_US
dc.titleA survey of scheduling problems with setup times or costsen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: C. T. Ngen_US
dc.description.otherinformationAuthor name used in this publication: T. C. E. Chengen_US
dc.identifier.spage985-
dc.identifier.epage1032-
dc.identifier.volume187-
dc.identifier.issue3-
dc.identifier.doi10.1016/j.ejor.2006.06.060-
dcterms.abstractThe first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by [Allahverdi, A., Gupta, J.N.D., Aldowaisan, T., 1999. A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences 27, 219–239], who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times. It further categorizes the literature according to shop environments, including single-machine, parallel machines, flow shop, no-wait flow shop, flexible flow shop, job shop, open shop, and others.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationEuropean journal of operational research, 16 June 2008, v. 187, no. 3, p. 985-1032-
dcterms.isPartOfEuropean journal of operational research-
dcterms.issued2008-06-16-
dc.identifier.isiWOS:000252556700018-
dc.identifier.scopus2-s2.0-36849082395-
dc.identifier.eissn1872-6860-
dc.identifier.rosgroupidr37236-
dc.description.ros2007-2008 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
SetupSurvey-2006(June-19).pdfPre-published version495.9 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

3,152
Last Week
3
Last month
Citations as of Apr 21, 2024

Downloads

1,928
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

1,098
Last Week
6
Last month
8
Citations as of Apr 26, 2024

WEB OF SCIENCETM
Citations

874
Last Week
0
Last month
5
Citations as of Apr 25, 2024

Google ScholarTM

Check

Altmetric


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