By Topic

Research on just-in-time scheduling

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
$31 $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

4 Author(s)
Endo, Y. ; Dept. of Syst. Eng., Univ. of Hosei, Tokyo, Japan ; Watanabe, K. ; Chiba, E. ; Kurihara, Y.

The aim of this paper is to research an existing just-in-time scheduling problems. Moreover, we propose a new algorithm for a just-in-time scheduling problem, and perform a comparison between it and an existing algorithm. The proposed algorithm has been based on the greedy algorithm. The greedy algorithm is the search method updating a solution in the direction where the improvement effect of the purpose function is the most remarkable only based on local information. As a result, we succeeded in introducing a new algorithm with a faster processing time than an existing algorithm.

Published in:

SICE Annual Conference (SICE), 2012 Proceedings of

Date of Conference:

20-23 Aug. 2012