Multimode Job Shop Scheduling Problem (MJSSP) aims at finding the start times and execution modes for the operations of different jobs that optimize a given set of objective functions while verifying precedence and resource constraints. In this paper, we focus on this problem and develop a Multi Objective Genetic Algorithm (MOGA) to solve it. Its main contributions are the mode assignment procedure in the chromosome generation and the use of three fitness functions. Its performance is demonstrated by computational results obtained on a set of standard instances and against the best currently available algorithms.
La Scalia, G., Aiello, G., Micale, R., Giallanza, A. (2014). Multi Objective Genetic Algorithm for multimode job shop scheduling problem. In European Operations Management Association (EurOMA) 2014.
Multi Objective Genetic Algorithm for multimode job shop scheduling problem
LA SCALIA, Giada;AIELLO, Giuseppe;MICALE, Rosa;GIALLANZA, Antonio
2014-01-01
Abstract
Multimode Job Shop Scheduling Problem (MJSSP) aims at finding the start times and execution modes for the operations of different jobs that optimize a given set of objective functions while verifying precedence and resource constraints. In this paper, we focus on this problem and develop a Multi Objective Genetic Algorithm (MOGA) to solve it. Its main contributions are the mode assignment procedure in the chromosome generation and the use of three fitness functions. Its performance is demonstrated by computational results obtained on a set of standard instances and against the best currently available algorithms.
| File | Dimensione | Formato | |
|---|---|---|---|
|
euroma 2014.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
230.14 kB
Formato
Adobe PDF
|
230.14 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
