@ARTICLE{Bazan_Marek_Optimization_2024,
 author={Bazan, Marek and Smutnicki, Czesław and Marchwiany, Maciej E.},
 volume={vol. 70},
 number={No 1},
 journal={International Journal of Electronics and Telecommunications},
 pages={59–69},
 howpublished={online},
 year={2024},
 publisher={Polish Academy of Sciences Committee of Electronics and Telecommunications},
 abstract={We consider the real-life problem of planning tasks for teams in a corporation, in conditions of some restrictions. The problem takes into account various constraints, such as for instance flexible working hours, common meeting periods, time set aside for self-learning, lunchtimes and periodic performance of tasks. Additionally, only a part of the team may participate in meetings, and each team member may have their own periodic tasks such as self-development. We propose an algorithm that is an extension of the algorithm dedicated for scheduling on parallel unrelated processors with the makespan criterion. Our approach assumes that each task can be defined by a subset of employees or an entire team. However, each worker is of a different efficiency, so task completion times may differ. Moreover, the tasks are prioritized. The problem is NP-hard. Numerical experiments cover benchmarks with 10 instances of 100 tasks assigned to a 5-person team. For all instances, various algorithms such as branch-and-bound, genetic and tabu search have been tested.},
 type={Article},
 title={Optimization of a task schedule for teams with members having various skills},
 URL={http://journals.pan.pl/Content/130694/8_4453_Bazan_L_sk.pdf},
 doi={10.24425/ijet.2024.149515},
 keywords={unrelated parallel machine scheduling problem, task scheduling for corporation teams, genetic algorithms, tabu search, branch and bound},
}