Flow shop scheduling with flexible processing times
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Bultmann, Matthias | |
dc.contributor.author | Knust, Sigrid | |
dc.contributor.author | Waldherr, Stefan | |
dc.date.accessioned | 2021-12-23T16:07:28Z | - |
dc.date.available | 2021-12-23T16:07:28Z | - |
dc.date.issued | 2018 | |
dc.identifier.issn | 01716468 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/7883 | - |
dc.description.abstract | In numerous flow shop variants, the processing times of the operations are not fixed in advance, but may be distributed with some flexibility among the machines. In this paper, we introduce a general model which is expressive enough to cover several models from the literature. While in most cases it is -hard to find a job permutation and a corresponding distribution of processing times minimizing the makespan, we show that for a fixed job permutation a best processing time distribution can be calculated in polynomial time by linear programming. Based on this, we propose a tabu search procedure using the set of all job permutations as search space. In a computational study, we show the power of the new model. Besides the classical permutation flow shop environment, we study variants with blocking, no-wait and synchronous movement constraints. | |
dc.description.sponsorship | Deutsche ForschungsgemeinschaftGerman Research Foundation (DFG) [KN 512/7-1]; TUM Institute for Advanced Study through a Hans Fischer Senior Fellowship; This work was supported by the Deutsche Forschungsgemeinschaft, KN 512/7-1. The work of Stefan Waldherr was supported by the TUM Institute for Advanced Study through a Hans Fischer Senior Fellowship. The authors would like to thank two anonymous referees for their constructive comments. | |
dc.language.iso | en | |
dc.publisher | SPRINGER | |
dc.relation.ispartof | OR SPECTRUM | |
dc.subject | Flexible processing times | |
dc.subject | Flow shop | |
dc.subject | JOBS | |
dc.subject | MACHINE | |
dc.subject | MAKESPAN | |
dc.subject | Operations Research & Management Science | |
dc.subject | Processing time redistribution | |
dc.subject | Scheduling | |
dc.subject | SEQUENCING PROBLEM | |
dc.title | Flow shop scheduling with flexible processing times | |
dc.type | journal article | |
dc.identifier.doi | 10.1007/s00291-018-0520-8 | |
dc.identifier.isi | ISI:000435585800008 | |
dc.description.volume | 40 | |
dc.description.issue | 3 | |
dc.description.startpage | 809 | |
dc.description.endpage | 829 | |
dc.identifier.eissn | 14366304 | |
dc.publisher.place | 233 SPRING ST, NEW YORK, NY 10013 USA | |
dcterms.isPartOf.abbreviation | OR Spectrum | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | BuMa777 | - |
crisitem.author.netid | KnSi808 | - |
crisitem.author.netid | WaSt588 | - |
Seitenaufrufe
4
Letzte Woche
0
0
Letzter Monat
2
2
geprüft am 01.06.2024