Parallel machine scheduling with general sum of processing time based models

Radosław Rudek

Abstract

In this paper, we analyse the parallel machine makespan minimization problem with the general sum of processing time based learning or aging effects. First, we prove that an optimal solution to the single machine case can be found by priority rules. Next, for the considered parallel machine problem, we construct the exact dynamic programming algorithm that can operate on real-valued job processing times, which is the only exact algorithm for the analysed problem. The computational analysis confirms that it can solve optimally moderate problem instances
Author Radosław Rudek (MISaF / IBI / DIT)
Radosław Rudek,,
- Department of Information Technologies
Journal seriesJournal of Global Optimization, ISSN 0925-5001, e-ISSN 1573-2916, (A 30 pkt)
Issue year2017
Vol68
No4
Pages799-814
Publication size in sheets39.95
Keywords in Englishscheduling, parallel machine, learning effect, aging effect, dynamic programming
ASJC Classification2604 Applied Mathematics; 1803 Management Science and Operations Research; 2606 Control and Optimization; 1706 Computer Science Applications
DOIDOI:10.1007/s10898-017-0509-x
URL https://link.springer.com/content/pdf/10.1007%2Fs10898-017-0509-x.pdf
Languageen angielski
File
Rudek_Parallel_ machine_ scheduling2017.pdf 605,22 KB
Score (nominal)30
ScoreMinisterial score = 30.0, 20-08-2019, ArticleFromJournal
Publication indicators Scopus Citations = 3; Scopus SNIP (Source Normalised Impact per Paper): 2017 = 1.526; WoS Impact Factor: 2017 = 1.407 (2) - 2017=1.734 (5)
Citation count*6 (2019-12-01)
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back