Cart (Loading....) | Create Account
Close category search window

Memorial self evolution algorithm to solve JIT machine 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
$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

2 Author(s)
Wei Weng ; Grad. Sch. of Inf., Waseda Univ., Fukuoka ; Fujimura, S.

The just-in-time (JIT) concept is of great importance in many manufacturing processes. JIT scheduling problems affects the performance of the whole production procedure, because early in job completion causes inventory cost while delay in job completion raises penalties paid to customers. In this paper, a memorial self evolution algorithm is proposed to solve the problem of total earliness and tardiness penalties on a machine unit with a common due date. Up to now, researches on this problem have paid no specific attention to straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Thus, efforts have been made on searching good straddling V-shaped schedules, and optimizing start time setting of schedules. A GHRM approach is proposed to create the initial solution for memorial self evolution. Meanwhile a database which keeps the memories of the elite solutions is introduced to deliver better initial solutions for similar problems. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs. The results show that the proposed memorial self evolution algorithm delivers better results in in finding optimal or near-optimal solutions than previous researches.

Published in:

Industrial Informatics, 2008. INDIN 2008. 6th IEEE International Conference on

Date of Conference:

13-16 July 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.