By Topic

A Virtual Preemption Paradigm for Using Priority Rules to Solve Job Shop Scheduling Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tsung-Che Chiang ; Dept. of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C. r88008@csie.ntu.edu.tw ; Li-Chen Fu

To solve job shop scheduling problems, the priority rule is one of the most popular approach. It has the appeal because of simplicity, efficiency and effectiveness. However, the paradigm conventionally used to apply priority rules has a certain flaw. In this paper, we first point out this flaw and then propose a paradigm to remove it. A rule is also developed to exploit the potential of the new paradigm. The performance of the proposed approach is verified by several simulation experiments. The experimental results are quite satisfactory.

Published in:

Proceedings of the 2005 IEEE International Conference on Robotics and Automation

Date of Conference:

18-22 April 2005