By Topic

A simplified scatter search for a special single machine scheduling problem to minimize total weighted tardiness

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)
Xianpeng Wang ; Liaoning Key Laboratory of Manufacturing System and Logistics, the Logistics Institute, Northeastern University, Shenyang, 110004, China ; Lixin Tang

This paper investigates a new kind of single machine scheduling problem derived from the production scheduling of reheating furnaces in the iron and steel industry. In this problem, the single machine can simultaneously process multiple jobs. However, there is no batch and the jobs enter and leave the machine one by one and continuously. The objective is to minimize the total weighted tardiness of all jobs. We formulate this problem as a mixed integer linear programming (MILP) model and propose a simplified scatter search algorithm. The computational results on randomly generated instances show that the MILP model is correct and the proposed SSS algorithm outperforms CPLEX.

Published in:

Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009. Proceedings of the 48th IEEE Conference on

Date of Conference:

15-18 Dec. 2009