Autor: Figielska, E. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
Autorzy:: Figielska, E.
Powiązania:: https://bibliotekanauki.pl/articles/91270.pdf
Data publikacji:: 2014
Wydawca:: Warszawska Wyższa Szkoła Informatyki
Tematy:: flowshop
parallel machines
resource constraints
scheduling
heuristic
Opis:: The paper addresses the problem of scheduling in the two-stage flowshop with parallel unrelated machines and renewable resource constraints. The objective is minimization of makespan. The problem is NP-hard. Fast heuristic algorithms using list scheduling and greedy strategies are proposed. For evaluation of the performance of the algorithms computational experiments are performed on randomly generated test problems, and results are reported.
Źródło:: Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2014, 8, 11; 29-39
1896-396X
2082-8349
Pojawia się w:: Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Linear programming & metaheuristic approach for scheduling in the hybrid flowshop with resource constraints
Autorzy:: Figielska, E.
Powiązania:: https://bibliotekanauki.pl/articles/206283.pdf
Data publikacji:: 2011
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: flowshop
parallel machines
resource constraints
heuristics
linear programming
genetic algorithms
simulated annealing
tabu search
Opis:: This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and additional renewable resources. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms are proposed which join the linear programming based procedures with metaheuristic algorithms: genetic, simulated annealing and tabu search algorithm. The performance of the proposed algorithms is experimentally evaluated by comparing the solutions with a lower bound on the optimal makespan. Results of a computational experiment show that these algorithms are able to produce good solutions in short computation time and that the metaheuristics significantly improve the results for the most difficult problems.
Źródło:: Control and Cybernetics; 2011, 40, 4; 1209-1230
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja