Results
Title

Study on resource allocation scheduling problem with learning factors and group technology.

Authors

Yan, Jia-Xuan; Ren, Na; Bei, Hong-Bin; Bao, Han; Wang, Ji-Bo

Abstract

This paper investigates the single-machine resource allocation scheduling problem with learning effects and group technology. The objective is to determine the optimal job and group schedules, and resource allocations such that total completion time is minimized subject to limited resource availability. For some special cases, we show that the problem remains polynomially solvable. For general case of the problem, we propose the heuristic algorithm, tabu search algorithm and branch-and-bound algorithm. Numerical experiments are tested to evaluate the performance of the heuristic and branch-and-bound algorithms.

Subjects

RESOURCE allocation; TABU search algorithm; GROUP technology; COMPUTER scheduling; HEURISTIC algorithms; MULTICASTING (Computer networks); SCHEDULING

Publication

Journal of Industrial & Management Optimization, 2023, Vol 19, Issue 5, p1

ISSN

1547-5816

Publication type

Academic Journal

DOI

10.3934/jimo.2022091