By Topic

A Genetic Algorithm with Dominance Properties for Single Machine 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

4 Author(s)
Shih-Shin Chen ; Department of Industrial Engineering and Management, Yuan-Ze University. e-mail: ; Pei-Chann Chang ; Shih-Min Hsiung ; Chin-Yuan Fan

This paper considers a single machine scheduling problem in which n jobs are to be processed and a machine setup time is required when the machine switches jobs from one to the other. All jobs have a common due date that has been predetermined using the median of the set of sequenced jobs. The objective is to find an optimal sequence of the set of n jobs to minimize the sum of the job's setups and the cost of tardy or early jobs related to the common due date. Dominance properties are developed according to the sequence swapping of two neighborhood jobs. These dominance properties are further embedded in the simple genetic algorithm to improve the efficiency and effectiveness of the global searching procedure. Analytical results in benchmark problems are presented and computational algorithms are developed

Published in:

2007 IEEE Symposium on Computational Intelligence in Scheduling

Date of Conference:

1-5 April 2007