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

Utpal Roy, Xiaoyan Zhang

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


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 algorithm aimed at achieving this goal. The concept of new membership functions is discussed in the 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.

Original languageEnglish (US)
Pages (from-to)299-311
Number of pages13
JournalProduction Planning and Control
Issue number3
StatePublished - 1996


  • Dynamic scheduling
  • Fuzzy model
  • Job shop scheduling
  • Scheduling

ASJC Scopus subject areas

  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'A heuristic approach to n/m job shop scheduling: Fuzzy dynamic scheduling algorithms'. Together they form a unique fingerprint.

Cite this