By Topic

A New Heuristic Method for Job-Shop Scheduling Problem

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

1 Author(s)
Kuang-Ping Liu ; MBA, National Taiwan University, Graduate Institute of Business Administration, National Taiwan University; Master student, Department of Computer Science and Information Engineering, National Taiwan University. e-mail:

We describe a heuristic method for solving the minimum makespan problem of job shop scheduling. It makes use of the disjunctive graph, and set the direction of the disjunctive arcs as decision variables. The decision variables, as micro bottlenecks, are cleared one by one, following the critical path algorithm. Once a new disjunctive arc is adopted all the implicit disjunctive arcs will be decided. The time complexity is O (n2). Computational testing is performed to solve the notorious ten machines /ten jobs problem in running time of 8.272 CPU seconds on a P-II 450 MHz PC, however, without finding an optimal solution. Finally, we verified the algorithm by testing a 100x30 (100 jobs/30 machines) problem, which may contribute to be one of the new benchmark problems.

Published in:

2006 IEEE International Conference on Systems, Man and Cybernetics  (Volume:5 )

Date of Conference:

8-11 Oct. 2006