Motivated by an industrial application, this study addresses scheduling on a single batch-processing machine with limited capacity, accounting for compatible families and sequence-dependent setup times. Non-identical jobs are assigned to batches and processed simultaneously to minimize makespan. Batch duration is set by the longest job, while setups depend on the dominant families of consecutive batches. We develop and compare alternative MILP formulations strengthened through problem-specific valid inequalities. Computational results show improved solution times, quality, and scalability.
Advanced MILP Approaches for Optimizing Single-Machine Batch Scheduling with Families and Setups
Annalisa Castelletti
;Renata Mansini;Lorenzo Moreschini
2026-01-01
Abstract
Motivated by an industrial application, this study addresses scheduling on a single batch-processing machine with limited capacity, accounting for compatible families and sequence-dependent setup times. Non-identical jobs are assigned to batches and processed simultaneously to minimize makespan. Batch duration is set by the longest job, while setups depend on the dominant families of consecutive batches. We develop and compare alternative MILP formulations strengthened through problem-specific valid inequalities. Computational results show improved solution times, quality, and scalability.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
book_of_abstarct-ifors2026.pdf
accesso aperto
Descrizione: Book of Abstract
Tipologia:
Abstract
Licenza:
Non specificato
Dimensione
8.46 MB
Formato
Adobe PDF
|
8.46 MB | Adobe PDF | Visualizza/Apri |
|
Abstarct_Ifors_Vienna26.pdf
accesso aperto
Descrizione: Abstract
Tipologia:
Abstract
Licenza:
Non specificato
Dimensione
70.08 kB
Formato
Adobe PDF
|
70.08 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


