A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty
Publication date:
Editorial:
Springer
Publisher version:
Citación:
Descripción física:
Abstract:
In this work we consider a multiobjective job shop problem with uncertain durations and crisp due dates. Ill-known durations are modelled as fuzzy numbers. We take a fuzzy goal programming approach to propose a generic multiobjective model based on lexicographical minimisation of expected values. To solve the resulting problem, we propose a genetic algorithm searching in the space of possibly active schedules. Experimental results are presented for several problem instances, solved by the GA according to the proposed model, considering three objectives: makespan, tardiness and idleness. The results illustrate the potential of the proposed multiobjective model and genetic algorithm
In this work we consider a multiobjective job shop problem with uncertain durations and crisp due dates. Ill-known durations are modelled as fuzzy numbers. We take a fuzzy goal programming approach to propose a generic multiobjective model based on lexicographical minimisation of expected values. To solve the resulting problem, we propose a genetic algorithm searching in the space of possibly active schedules. Experimental results are presented for several problem instances, solved by the GA according to the proposed model, considering three objectives: makespan, tardiness and idleness. The results illustrate the potential of the proposed multiobjective model and genetic algorithm
ISSN:
Identificador local:
20100737
Patrocinado por:
All authors are supported by MEC-FEDER Grant TIN2007- 67466-C02-01
Collections
- Artículos [36471]
- Informática [813]
- Investigaciones y Documentos OpenAIRE [8110]
Files in this item
