Paper Info
Title
Fuzzy job shop scheduling problem with availability constraints
Abstract
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.
Year
DOI
Venue
2010
10.1016/j.cie.2010.01.002
Computers & Industrial Engineering
Keywords
Field
DocType
periodic maintenance,fuzzy scheduling problem,fuzzy due-date,fuzzy job shop scheduling,random key genetic algorithm,random key representation,computational result,genetic algorithm,novel random key representation,maintenance operation,discrete crossover,availability constraint,scheduling problem,indexation,job shop scheduling
Mathematical optimization,Multiprocessor scheduling,Job shop scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Nurse scheduling problem,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Operations management
Journal
Volume
Issue
ISSN
58
4
Computers & Industrial Engineering
Citations 
PageRank 
References 
15
0.67
8
Authors
1
Name
Order
Citations
PageRank
De-ming Lei117618.60