| Publikationstyp: | Beitrag in wissenschaftlicher Zeitschrift |
| Art der Begutachtung: | Peer review (Publikation) |
| Titel: | Feasible insertions in job shop scheduling, short cycles and stable sets |
| Autor/-in: | Gröflin, Heinz Klinkert, Andreas |
| DOI: | 10.1016/j.ejor.2005.12.025 |
| Erschienen in: | European Journal of Operational Research |
| Band(Heft): | 177 |
| Heft: | 2 |
| Seite(n): | 763 |
| Seiten bis: | 785 |
| Erscheinungsdatum: | 2007 |
| Verlag / Hrsg. Institution: | Elsevier |
| ISSN: | 0377-2217 |
| Sprache: | Englisch |
| Schlagwörter: | Insertion; Scheduling; Job shop |
| Fachgebiet (DDC): | 510: Mathematik |
| Zusammenfassung: | Insertion problems arise in scheduling when additional activities have to be inserted into a given schedule. This paper investigates insertion problems in a general disjunctive scheduling framework capturing a variety of job shop scheduling problems and insertion types. First, a class of scheduling problems is introduced, characterized by disjunctive graphs with the so-called short cycle property, and it is shown that in such problems, the feasible selections correspond to the stable sets of maximum cardinality in an associated conflict graph. Two types of insertion problems are then identified where the underlying disjunctive graph is through- or bi-connected. For these cases, it is shown that the short cycle property holds and the conflict graph is bipartite, allowing to derive a polyhedral characterization of all feasible insertions. An efficient method for deciding whether there exists a feasible insertion, and a lower and upper bound procedure for the minimum makespan insertion problem are developed. For bi-connected graphs, this procedure solves the insertion problem to optimality. The obtained results are applied to three extensions of the classical Job Shop, the Multi-Processor Task, Blocking and No-Wait Job Shop, and two types of insertions, job and block insertion. |
| URI: | https://digitalcollection.zhaw.ch/handle/11475/3602 |
| Volltext Version: | Publizierte Version |
| Lizenz (gemäss Verlagsvertrag): | Lizenz gemäss Verlagsvertrag |
| Departement: | School of Engineering |
| Organisationseinheit: | Institut für Datenanalyse und Prozessdesign (IDP) |
| Enthalten in den Sammlungen: | Publikationen School of Engineering |
Dateien zu dieser Ressource:
Es gibt keine Dateien zu dieser Ressource.
Zur Langanzeige
Gröflin, H., & Klinkert, A. (2007). Feasible insertions in job shop scheduling, short cycles and stable sets. European Journal of Operational Research, 177(2), 763–785. https://doi.org/10.1016/j.ejor.2005.12.025
Gröflin, H. and Klinkert, A. (2007) ‘Feasible insertions in job shop scheduling, short cycles and stable sets’, European Journal of Operational Research, 177(2), pp. 763–785. Available at: https://doi.org/10.1016/j.ejor.2005.12.025.
H. Gröflin and A. Klinkert, “Feasible insertions in job shop scheduling, short cycles and stable sets,” European Journal of Operational Research, vol. 177, no. 2, pp. 763–785, 2007, doi: 10.1016/j.ejor.2005.12.025.
GRÖFLIN, Heinz und Andreas KLINKERT, 2007. Feasible insertions in job shop scheduling, short cycles and stable sets. European Journal of Operational Research. 2007. Bd. 177, Nr. 2, S. 763–785. DOI 10.1016/j.ejor.2005.12.025
Gröflin, Heinz, and Andreas Klinkert. 2007. “Feasible Insertions in Job Shop Scheduling, Short Cycles and Stable Sets.” European Journal of Operational Research 177 (2): 763–85. https://doi.org/10.1016/j.ejor.2005.12.025.
Gröflin, Heinz, and Andreas Klinkert. “Feasible Insertions in Job Shop Scheduling, Short Cycles and Stable Sets.” European Journal of Operational Research, vol. 177, no. 2, 2007, pp. 763–85, https://doi.org/10.1016/j.ejor.2005.12.025.
Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt, soweit nicht anderweitig angezeigt.