We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Single machine group scheduling problem with makespan objective and a proportional linear shortening.
- Authors
Wang, Ji-Bo; Jia, Xue; Yan, Jia-Xuan; Wang, Si-Han; Qian, Jin
- Abstract
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.
- Subjects
PRODUCTION scheduling; SETUP time; HEURISTIC algorithms; SCHEDULING; PROBLEM solving
- Publication
RAIRO: Operations Research (2804-7303), 2022, Vol 56, Issue 3, p1523
- ISSN
2804-7303
- Publication type
Article
- DOI
10.1051/ro/2022078