2004 | OriginalPaper | Buchkapitel
Changeover Times and Transportation Times
verfasst von : Professor Dr. Peter Brucker
Erschienen in: Scheduling Algorithms
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this chapter we consider scheduling problems in which the set I of all jobs or all operations (in connection with shop problems) is partitioned into disjoint sets Il,... , I r called groups, i.e. I = Il ∪ I2 ∪ ... ∪ I r and I f ∩ I g = Ø for f, g ∈ {1,... , r},f ≠ g. Let N j be the number of jobs in I j . Furthermore, we have the additional restrictions that for any two jobs (operations) i, j with i ∈ I f and j ∈ I g to be processed on the same machine M k , job (operation) j cannot be started until s fgk time units after the finishing time of job (operation) i, or job (operation) i cannot be started until s gfk time units after the finishing time of job (operation) j. In a typical application, the groups correspond to different types of jobs (operations) and s fgk may be interpreted as a machine dependent changeover time. During the changeover period, the machine cannot process another job. We assume that s fgk = 0 for all f, g ∈ {1,... ,r}, k ∈ {1,... , m} with f = g,and that the triangle inequality holds:9.1 $${s_{fgk}} + {s_{fhk}}{s_{fhk}}\,for\,all\,f,g,h \in \{ 1,...,r\} ,k \in \{ 1,...,m\} .$$