By Topic

A new optimization approach to the general single machine earliness-tardiness 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

3 Author(s)
Yunpeng Pan ; Dept. of Ind. Eng., Wisconsin Univ., Madison, WI, USA ; Leyuan Shi ; Hoksung Yau

In this paper, we consider the single-machine earliness-tardiness (E-T) scheduling problem with distinct release dates, due dates, and E-T costs. The problem is formulated using dynamic programming. The solution procedure embodies a new hybrid optimization approach called generalized dynamic programming (GDP), which incorporates techniques from two methodologies: dynamic programming and branch-and-bound. An assignment-based lower bound is employed in branch-and-bound. We test 135 random instances with up to 30 jobs to evaluate the algorithm's performance. It shows that the GDP approach achieves much better results than linear programming-based branch-and-bound algorithms such as those included in the commercial package, CPLEX.

Published in:

IEEE International Conference on Automation Science and Engineering, 2005.

Date of Conference:

1-2 Aug. 2005