Volume 56, Number 3, May-June 2022
|Page(s)||1523 - 1532|
|Published online||16 June 2022|
Single machine group scheduling problem with makespan objective and a proportional linear shortening
School of Science, Shenyang Aerospace University, Shenyang 110136, P.R. China
2 Department of Mathematical Sciences, Northeastern University, Shenyang 110819, P.R. China
* Corresponding author: email@example.com
Accepted: 14 May 2022
This paper considers a group scheduling problem with shorten (i.e., a proportional linear shortening) job processing times and ready times on a single machine. If the jobs are in the same group, they have independent and constant ready times. The setup time of a group is independent constant setup time between each group. The goal is to determine the optimal group sequence and the job sequence within the groups such that the makespan (i.e., the maximum completion time) is minimized. For the general case of the problem, an initial heuristic algorithm (an upper bound) and some lower bounds are proposed, and then a branch-and-bound algorithm can be developed to solve the problem.
Mathematics Subject Classification: 90B35
Key words: scheduling / group technology / shortening job processing times / branch-and-bound algorithm
© The authors. Published by EDP Sciences, ROADEF, SMAI 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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.