Реферат: We consider the problem of forming clusters of client orders in production and service systems. Jobs and units (machines) should be assigned and scheduled for clients and workers in accordance with available time slots (work shifts). Preferences to time slots and jobs are given for each client and worker. Moreover, we have constraints on the number of clients in clusters, the number of clusters for workers, diversity of jobs for clients and other restrictions on the conditions of clusters forming. The goal is to maximize the sum of client weights (costs or preference indicators) assigned in clusters. We propose an integer linear programming model and adopt such approaches for solving the problem as relax-and-fix method and branch-and-cut algorithm. NP-hard and polynomially solvable cases are identified.

Библиографическая ссылка: Zakharova Y. , Ushakova E.
Integer Model and Complexity of Worker Assignment and Job Scheduling in Production and Service Systems
В сборнике 2022 Dynamics of Systems, Mechanisms and Machines (Dynamics). – IEEE., 2022. – C.pp. 1-5. – ISBN 9781665465274. DOI: 10.1109/Dynamics56256.2022.10014726 Scopus OpenAlex

Даты:

Принята к публикации:	10 нояб. 2022 г.
Опубликована online:	18 янв. 2023 г.

Идентификаторы БД:

Scopus:	2-s2.0-85147713352
OpenAlex:	W4317418550

Цитирование в БД: Пока нет цитирований

Альметрики: