Special Issue Paper
Journal of the Operational Research Society (2008) 59, 431–442. doi:10.1057/palgrave.jors.2602351 Published online 14 February 2007
Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approach
R Tavakkoli-Moghaddam1, N Safaei2 and M M O Kah3
- 1University of Tehran, Tehran, Iran
- 2Iran University of Science and Technology, Tehran, Iran
- 3Abti-American University of Nigeria, Yola, Nigeria and American University, Washington, DC, USA
Correspondence: R Tavakkoli-Moghaddam, Department of Industrial Engineering and Center of Excellence of Intelligence Based Experimental Mechanics, Faculty of Engineering, University of Tehran, PO Box 11365-4563, Tehran, Iran. E-mail: tavakoli@ut.ac.ir
Received August 2005; Accepted September 2006; Published online 14 February 2007.
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. The computational results show that the proposed neural approach is able to find good solutions in reasonable time.
Keywords:
generalized job shop scheduling, fuzzy processing time, constraint satisfaction, neural networks
MORE ARTICLES LIKE THIS
These links to content published by Palgrave Macmillan are automatically generated.
RESEARCH
Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approachJournal of the Operational Research Society Special Feature


