Fuzzy job shop scheduling problem with availability constraints

This paper presents the fuzzy job shop scheduling problem with availability constraints. The objective is to find a schedule that maximizes the minimum agreement index subject to periodic maintenance, non-resumable jobs and fuzzy due-date. A random key genetic algorithm (RKGA) is proposed for the pr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & industrial engineering Ročník 58; číslo 4; s. 610 - 617
Hlavní autor: Lei, Deming
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.05.2010
Pergamon Press Inc
Témata:
Algorithms
Comparative analysis
Fuzzy job shop scheduling
Fuzzy logic
Genetic algorithm
Genetic algorithms
Job shops
Periodic maintenance
Production scheduling
Random key representation
Repair & maintenance
Studies
Fuzzy job shop scheduling
Random key representation
Genetic algorithm
Periodic maintenance
ISSN:0360-8352, 1879-0550
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents the fuzzy job shop scheduling problem with availability constraints. The objective is to find a schedule that maximizes the minimum agreement index subject to periodic maintenance, non-resumable jobs and fuzzy due-date. A random key genetic algorithm (RKGA) is proposed for the problem, in which a novel random key representation, a new decoding strategy incorporating maintenance operation and discrete crossover ( DX) are used. RKGA is applied to some fuzzy scheduling problem with availability constraints and compared with other algorithms. Computational results show that RKGA performs better than other algorithms.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2010.01.002