Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times
Keyword(s):
AbstractWe consider a number of parallel-machine scheduling problems in which jobs have variable processing times. The actual processing time of each job is described by an arbitrary positive function of the position it holds on a machine. However, the function itself may additionally depend on the job or a machine this job was assigned to. Our aim is to find a schedule that minimizes the objectives of maximum completion time or the total completion time. We present a full set of polynomial solutions for the cases of jobs with no precedence constraints. We also show that the case of single-chained jobs may be not easier in general, but some polynomial results can be obtained, too.
2020 ◽
Vol 2020
◽
pp. 1-6
◽
2015 ◽
Vol 4
(1)
◽
pp. 37
◽
2016 ◽
Vol 67
(4)
◽
pp. 654-663
◽
2016 ◽
Vol 4
(1)
◽
pp. 37
2004 ◽
Vol 31
(10)
◽
pp. 1565-1581
◽
2003 ◽
Vol 306
(1-3)
◽
pp. 319-338
◽
2016 ◽
Vol 33
(01)
◽
pp. 1650001
◽
1997 ◽
Vol 26
(12)
◽
pp. 1-11
◽