This paper addresses the class of permutation flow shop scheduling where jobs, after their completion, must be grouped in batches. This is a common scheme in industrial environments, where products undergo multiple process steps in different shops and, when completed, must be transported to customers or the next production step. A new optimisation criterion is used, the inter-exit time, i.e., the difference between the completion times of two jobs. An upper bound is proposed and demonstrated for a general permutation flow shop with m machines.
An upper bound for the inter-exit time of two jobs in an m-machine flow shop
Urgo M.;Manzini M.
2024-01-01
Abstract
This paper addresses the class of permutation flow shop scheduling where jobs, after their completion, must be grouped in batches. This is a common scheme in industrial environments, where products undergo multiple process steps in different shops and, when completed, must be transported to customers or the next production step. A new optimisation criterion is used, the inter-exit time, i.e., the difference between the completion times of two jobs. An upper bound is proposed and demonstrated for a general permutation flow shop with m machines.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
An upper bound for the inter-exit time of two jobs in an m-machine flow shop.pdf
accesso aperto
:
Publisher’s version
Dimensione
998.4 kB
Formato
Adobe PDF
|
998.4 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.