A heuristic approach to n/ m job shop scheduling: fuzzy dynamic scheduling algorithms

n/m shop scheduling is a ' NP-Hard' problem. Using conventional heuristic algorithms ( priority rules) only, it is almost impossible to achieve an optimal solution. Research has been carried out to improve the heuristic algorithms to give a near-optimal solution. This paper advocates a fuz...

Full description

Saved in:
Bibliographic Details
Published inProduction planning & control Vol. 7; no. 3; pp. 299 - 311
Main Authors ROY, UTPAL, ZHANG, XIAOYAN
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.05.1996
Subjects
dynamic scheduling
fuzzy model
job shop scheduling
scheduling
Online AccessGet full text
ISSN0953-7287
1366-5871
DOI10.1080/09537289608930356

Cover

More Information
Summary:n/m shop scheduling is a ' NP-Hard' problem. Using conventional heuristic algorithms ( priority rules) only, it is almost impossible to achieve an optimal solution. Research has been carried out to improve the heuristic algorithms to give a near-optimal solution. This paper advocates a fuzzy logic based, dynamic scheduling algoridim aimed at achieving this goal. The concept of new membership functions is discussed in die algorithm as a link to connect several priority rules. The constraints to determine the membership function of jobs for a particular priority rule are established, and three membership functions are developed. In order to decide the weight vector of priority rules, an aggregate performance measure is suggested. The methodology for constructing the weight vector is discussed in detail. Experiments have been carried out using a simulation technique to validate the proposed scheduling algorithm.
ISSN:0953-7287
1366-5871
DOI:10.1080/09537289608930356