Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approach

Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approach

0.00 Avg rating0 Votes
Article ID: iaor20091002
Country: United Kingdom
Volume: 59
Issue: 4
Start Page Number: 431
End Page Number: 442
Publication Date: Apr 2008
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: fuzzy sets, neural networks
Abstract:

This paper presents a fuzzy-neural approach for constraint satisfaction of a generalized job shop scheduling problem (GJSSP) fuzzy processing times. Our study is an extension of recently developed research in a GJSSP where the processing time of operations was constant. Our paper assumes that the processing time of jobs is uncertain. The proposed fuzzy-neural approach can be adaptively adjusted with weights of connections based on sequence resource and uncertain processing time constraints of the GJSSP during its processing.

Reviews

Required fields are marked *. Your email address will not be published.