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

Autor:	Yan, Jia-Xuan, Ren, Na, Bei, Hong-Bin, Bao, Han, Wang, Ji-Bo
Předmět:	RESOURCE allocation TABU search algorithm GROUP technology COMPUTER scheduling HEURISTIC algorithms MULTICASTING (Computer networks) SCHEDULING
Zdroj:	Journal of Industrial & Management Optimization; May2023, Vol. 19 Issue 5, p1-17, 17p
Abstrakt:	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. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu