1. ZHAW digitalcollection
  2. School of Engineering
  3. Publikationen
  4. Publikationen School of Engineering
Please use this identifier to cite or link to this item: https://doi.org/10.21256/zhaw-3528
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGröflin, Heinz-
dc.contributor.authorKlinkert, Andreas-
dc.date.accessioned2018-03-09T07:40:28Z-
dc.date.available2018-03-09T07:40:28Z-
dc.date.issued2009-
dc.identifier.issn0166-218Xde_CH
dc.identifier.issn1872-6771de_CH
dc.identifier.urihttps://digitalcollection.zhaw.ch/handle/11475/3627-
dc.description.abstractThe Blocking Job Shop is a version of the job shop scheduling problem with no intermediate buffers, where a job has to wait on a machine until being processed on the next machine. We study a generalization of this problem which takes into account transfer operations between machines and sequence-dependent setup times. After formulating the problem in a generalized disjunctive graph, we develop a neighborhood for local search. In contrast to the classical job shop, there is no easy mechanism for generating feasible neighbor solutions. We establish two structural properties of the underlying disjunctive graph, the concept of closures and a key result on short cycles, which enable us to construct feasible neighbors by exchanging critical arcs together with some other arcs. Based on this neighborhood, we devise a tabu search algorithm and report on extensive computational experience, showing that our solutions improve most of the benchmark results found in the literature.de_CH
dc.language.isoende_CH
dc.publisherElsevierde_CH
dc.relation.ispartofDiscrete Applied Mathematicsde_CH
dc.rightsLicence according to publishing contractde_CH
dc.subjectTabu searchde_CH
dc.subjectBlockingde_CH
dc.subjectJob shop schedulingde_CH
dc.subjectNeighborhoodde_CH
dc.subject.ddc500: Naturwissenschaftende_CH
dc.titleA new neighborhood and tabu search for the blocking job shopde_CH
dc.typeBeitrag in wissenschaftlicher Zeitschriftde_CH
dcterms.typeTextde_CH
zhaw.departementSchool of Engineeringde_CH
zhaw.organisationalunitInstitut für Datenanalyse und Prozessdesign (IDP)de_CH
dc.identifier.doi10.21256/zhaw-3528-
dc.identifier.doi10.1016/j.dam.2009.02.020de_CH
zhaw.funding.euNode_CH
zhaw.issue17de_CH
zhaw.originated.zhawYesde_CH
zhaw.pages.end3655de_CH
zhaw.pages.start3643de_CH
zhaw.publication.statuspublishedVersionde_CH
zhaw.volume157de_CH
zhaw.publication.reviewPeer review (Publikation)de_CH
Appears in collections:Publikationen School of Engineering

Files in This Item:
File Description SizeFormat 
Groeflin-Klinkert-A-New-Neighborhood-And-Tabu-Search-For-The-Blocking-Job-Shop-DAM-2009.pdf895.38 kBAdobe PDFThumbnail
View/Open
Show simple item record
Gröflin, H., & Klinkert, A. (2009). A new neighborhood and tabu search for the blocking job shop. Discrete Applied Mathematics, 157(17), 3643–3655. https://doi.org/10.21256/zhaw-3528
Gröflin, H. and Klinkert, A. (2009) ‘A new neighborhood and tabu search for the blocking job shop’, Discrete Applied Mathematics, 157(17), pp. 3643–3655. Available at: https://doi.org/10.21256/zhaw-3528.
H. Gröflin and A. Klinkert, “A new neighborhood and tabu search for the blocking job shop,” Discrete Applied Mathematics, vol. 157, no. 17, pp. 3643–3655, 2009, doi: 10.21256/zhaw-3528.
GRÖFLIN, Heinz und Andreas KLINKERT, 2009. A new neighborhood and tabu search for the blocking job shop. Discrete Applied Mathematics. 2009. Bd. 157, Nr. 17, S. 3643–3655. DOI 10.21256/zhaw-3528
Gröflin, Heinz, and Andreas Klinkert. 2009. “A New Neighborhood and Tabu Search for the Blocking Job Shop.” Discrete Applied Mathematics 157 (17): 3643–55. https://doi.org/10.21256/zhaw-3528.
Gröflin, Heinz, and Andreas Klinkert. “A New Neighborhood and Tabu Search for the Blocking Job Shop.” Discrete Applied Mathematics, vol. 157, no. 17, 2009, pp. 3643–55, https://doi.org/10.21256/zhaw-3528.


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