Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
Journal Title: Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki - Year 2014, Vol 8, Issue 11
Abstract
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.
Authors and Affiliations
Ewa Figielska
Keywords
Related Articles
- EP ID EP169206
- DOI 10.26348/znwwsi.11.29
- Views 126
- Downloads 0
Architektura i zasada działania systemu IP Multimedia Subsystem
W niniejszym opracowaniu przedstawiono koncepcję systemu IP Multimedia Subsystem, skrótowy opis jego architektury, zasady działania, podstawowe scenariusze sygnalizacyjne oraz sposób realizacji usług. Opisywane koncepcje...
Numerical Coding of Nominal Data
In this paper, a novel approach for coding nominal data is proposed. For the given nominal data, a rank in a form of complex number is assigned. The proposed method does not lose any information about the attribute an...
Wybrane mechanizmy gwarantowania jakości usług w sieciach IP
W artykule zaprezentowano wybrane mechanizmy gwarantujące jakość usług w sieciach IP (FIFO, WFQ, PQ). Na potrzeby badań stworzono odpowiednie scenariusze symulacyjne w środowisku laboratoryjnym OPNET. Przedstawiono wpływ...
Successful MOOC project “IT School” for informatics education on secondary level
Warsaw School of Computer Science has launched a multi-annual MOOC project “IT School” to prepare and open on-line a number of popular courses and other materials in the area of “basics of computer knowledge” for student...
Extension of the one-dimensional Stoney algorithm to a two-dimensional case
This article presents the extension of the one-dimensional Stoney algorithm to a two-dimensional case. The proposed extension consists in modifying the method of curvature estimation. The surface profile of the wafer bef...