Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
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 eval...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Warsaw School of Computer Science
2014-12-01
|
| Series: | Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki |
| Subjects: | |
| Online Access: | http://zeszyty-naukowe.wwsi.edu.pl/zeszyty/zeszyt11/Algorithms_Using_List_Scheduling_and_Greedy_Strategies.pdf |