By Topic

A flowshop scheduling problem with machine deterioration and maintenance activities

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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)
Rudek, A. ; Dept. of Syst. & Comput. Networks, Wroclaw Univ. of Technol., Wrocław, Poland ; Rudek, R.

In this paper, we analyse the makespan minimization flowshop scheduling problem, where the processing times of jobs depend on the number of performed jobs and maintenance activities. Since the considered problem with two machines seems to be NP-hard, thus, we propose a branch and bound method and some heuristic and metaheuristic algorithms to solve it.

Published in:

Methods and Models in Automation and Robotics (MMAR), 2012 17th International Conference on

Date of Conference:

27-30 Aug. 2012