By Topic

A linear programming based heuristic for solving a two-stage flowshop 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

1 Author(s)
Figielska, E. ; Warsaw Sch. of Comput. Sci., Warsaw

This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and renewable resources at each stage. The resource requirements are of 0-1 type. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms using linear programming are proposed for solving this problem. Performance of the heuristic algorithms is analyzed by comparing heuristic solutions with the lower bound on the optimal makespan. The results of a computational experiment show that the proposed algorithms are able to produce good solutions in short computation time.

Published in:

Emerging Technologies and Factory Automation, 2007. ETFA. IEEE Conference on

Date of Conference:

25-28 Sept. 2007