Volume 55, Number 2, March-April 2021
|Page(s)||561 - 569|
|Published online||09 April 2021|
A note on parallel-machine scheduling with controllable processing times and job-dependent learning effects
School of Business and Management, Fujian Jiangxia University, Fuzhou 350108, P.R. China
* Corresponding author: email@example.com
Accepted: 23 February 2021
This note studies a unrelated parallel-machine scheduling problem with controllable processing times and job-dependent learning effects, where the objective function is to minimize the weighted sum of total completion time, total load, and total compression cost. We show that the problem can be solved in O(nm+2) time, where m and n are the numbers of machines and jobs. We also show how to apply the technique to several single-machine scheduling problems with total criteria.
Mathematics Subject Classification: 90B35 / 68M20
Key words: Scheduling / unrelated parallel-machine / controllable processing times / learning effect
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.