By Topic

A multi-objective identical parallel machine scheduling with setup and removal times with deteriorating and learning effects

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)
Amini, A. ; Dept. of Ind. Eng., Univ. of Tehran, Tehran, Iran ; Tavakkoli-Moghaddam, R. ; Niakan, F.

This paper considers an identical parallel machine scheduling problem when there are position-based deteriorating jobs with setup and removal times that are affected by the position-based learning effect. The aim of the problem is to minimize the sum of the total tardiness and earliness, minimize the number of tardy jobs and minimize the mean completion times. As a result, the mathematical model is developed for the above-mentioned problem. Since this problem belongs to NP-hard classes, three heuristic methods, namely shortest processing time (SPT), earliest due date (EDD) and longest processing time (LPT), are developed. Furthermore, some numerical experiments are designed to compare the performance of these different methods.

Published in:

Industrial Engineering and Engineering Management (IEEM), 2011 IEEE International Conference on

Date of Conference:

6-9 Dec. 2011