Temat: unrelated machine - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: Exact approaches to late work scheduling on unrelated machines
Autorzy:: Liu, Xinbo
Wang, Wen
Chen, Xin
Sterna, Malgorzata
Blazewicz, Jacek
Tematy:: late work scheduling
unrelated machine
mathematical model
branch algorithm
bound algorithm
dynamic programming
planowanie pracy
model matematyczny
algorytm podziału
algorytm ograniczeń
programowanie dynamiczne; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Powiązania:: https://bibliotekanauki.pl/articles/11542692.pdf Link otwiera się w nowym oknie
Opis:: We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: Optimization of a task schedule for teams with members having various skills
Autorzy:: Bazan, Marek
Smutnicki, Czesław
Marchwiany, Maciej E.
Tematy:: unrelated parallel machine scheduling problem
task scheduling for corporation teams
genetic algorithms
tabu search
branch and bound; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czasopisma i Monografie PAN
Powiązania:: https://bibliotekanauki.pl/articles/58972994.pdf Link otwiera się w nowym oknie
Opis:: 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.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "unrelated machine" wg kryterium: Temat