1. ZHAW digitalcollection
  2. School of Engineering
  3. Publikationen
  4. Publikationen School of Engineering
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGröflin, Heinz-
dc.contributor.authorKlinkert, Andreas-
dc.contributor.authorPham Dinh, Nguyen-
dc.date.accessioned2018-03-09T07:19:00Z-
dc.date.available2018-03-09T07:19:00Z-
dc.date.issued2008-
dc.identifier.issn0377-2217de_CH
dc.identifier.urihttps://digitalcollection.zhaw.ch/handle/11475/3614-
dc.description.abstractThe Multi-Processor-Task Job Shop is an extension of the Job Shop problem where an operation of a job requires a set of machines instead of a single machine. Job insertion is the following: given a feasible schedule of n-1 jobs, find a feasible insertion of job n into the schedule such that makespan is minimized. The problem is known to be NP-hard already for the Job Shop case. In this note, a polyhedral description of all feasible insertions is derived, settling an open problem recently proposed by Kis and Hertz. Constrained feasible insertions, satisfying additional constraints, are introduced and a feasibility theorem is established. A lower bound on the job insertion problem is derived and computed by repeatedly invoking the feasibility theorem. Numerical results show high quality of the bounds and short computation times.de_CH
dc.language.isoende_CH
dc.publisherElsevierde_CH
dc.relation.ispartofEuropean Journal of Operational Researchde_CH
dc.rightsLicence according to publishing contractde_CH
dc.subjectInsertionde_CH
dc.subjectSchedulingde_CH
dc.subjectJob shopde_CH
dc.subjectMulti-processorde_CH
dc.subject.ddc510: Mathematikde_CH
dc.titleFeasible Job Insertions in the Multi-Processor-Task 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.1016/j.ejor.2005.10.077de_CH
zhaw.funding.euNode_CH
zhaw.issue3de_CH
zhaw.originated.zhawYesde_CH
zhaw.pages.end1318de_CH
zhaw.pages.start1308de_CH
zhaw.publication.statuspublishedVersionde_CH
zhaw.volume185de_CH
zhaw.publication.reviewPeer review (Publikation)de_CH
Appears in collections:Publikationen School of Engineering

Files in This Item:
There are no files associated with this item.
Show simple item record
Gröflin, H., Klinkert, A., & Pham Dinh, N. (2008). Feasible Job Insertions in the Multi-Processor-Task Job Shop. European Journal of Operational Research, 185(3), 1308–1318. https://doi.org/10.1016/j.ejor.2005.10.077
Gröflin, H., Klinkert, A. and Pham Dinh, N. (2008) ‘Feasible Job Insertions in the Multi-Processor-Task Job Shop’, European Journal of Operational Research, 185(3), pp. 1308–1318. Available at: https://doi.org/10.1016/j.ejor.2005.10.077.
H. Gröflin, A. Klinkert, and N. Pham Dinh, “Feasible Job Insertions in the Multi-Processor-Task Job Shop,” European Journal of Operational Research, vol. 185, no. 3, pp. 1308–1318, 2008, doi: 10.1016/j.ejor.2005.10.077.
GRÖFLIN, Heinz, Andreas KLINKERT und Nguyen PHAM DINH, 2008. Feasible Job Insertions in the Multi-Processor-Task Job Shop. European Journal of Operational Research. 2008. Bd. 185, Nr. 3, S. 1308–1318. DOI 10.1016/j.ejor.2005.10.077
Gröflin, Heinz, Andreas Klinkert, and Nguyen Pham Dinh. 2008. “Feasible Job Insertions in the Multi-Processor-Task Job Shop.” European Journal of Operational Research 185 (3): 1308–18. https://doi.org/10.1016/j.ejor.2005.10.077.
Gröflin, Heinz, et al. “Feasible Job Insertions in the Multi-Processor-Task Job Shop.” European Journal of Operational Research, vol. 185, no. 3, 2008, pp. 1308–18, https://doi.org/10.1016/j.ejor.2005.10.077.


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