Share Email Print
cover

Proceedings Paper

Solution space analysis of manufacturing scheduling problems
Author(s): Yangsheng Li; Weiming Shen; Chun Wang; Hamada Ghenniwa
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper proposes a new method of analyzing the solution space of multi-factor manufacturing scheduling problems. The proposed method is introduced together with two new concepts: relation matrix and decision matrix. This method simplifies a multi-factor problem into a number of two-factor sub-problems which are then analyzed individually. Some close-expressions of the number of feasible solutions for multi-device, multi-worker and multi-task are obtained. It can be used not only to calculate the number of possible/feasible solutions, but also to obtain these solutions in simple cases. It is particularly useful in very complex situations, since the results of solution space analysis can help choose appropriate techniques or algorithms to solve complex scheduling problems.

Paper Details

Date Published: 11 November 2004
PDF: 12 pages
Proc. SPIE 5605, Intelligent Systems in Design and Manufacturing V, (11 November 2004); doi: 10.1117/12.568755
Show Author Affiliations
Yangsheng Li, National Research Council (Canada)
Weiming Shen, National Research Council (Canada)
Univ. of Western Ontario (Canada)
Chun Wang, National Research Council (Canada)
Univ. of Western Ontario (Canada)
Hamada Ghenniwa, National Research Council (Canada)
Univ. of Western Ontario (Canada)


Published in SPIE Proceedings Vol. 5605:
Intelligent Systems in Design and Manufacturing V
Bhaskaran Gopalakrishnan, Editor(s)

© SPIE. Terms of Use
Back to Top