Solving the FMS scheduling problem by critical ratio-based heuristics and the genetic algorithm

Tsung Che Chiang, Li Chen Fu

Research output: Contribution to journalConference article

14 Citations (Scopus)

Abstract

This paper addresses the FMS scheduling problem. The objective concerned here is maximizing the meet-due-date rate. The authors propose two rules for job sequencing and job dispatching, two common subtasks in solving this problem. These two rules are designed based on the critical ratio values of jobs. We also propose a mechanism to obtain better performance than the stand-alone scheduling process via genetic algorithms. With the nature of design of the proposed job sequencing rule, the genetic algorithm is designed not only to improve the schedule quality but also to save computation time. All the proposed rules and idea are carefully examined through several different scenarios.

Original languageEnglish
Pages (from-to)3131-3136
Number of pages6
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume2004
Issue number3
Publication statusPublished - 2004 Jul 5
EventProceedings- 2004 IEEE International Conference on Robotics and Automation - New Orleans, LA, United States
Duration: 2004 Apr 262004 May 1

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Solving the FMS scheduling problem by critical ratio-based heuristics and the genetic algorithm'. Together they form a unique fingerprint.

  • Cite this