- Tytuł:
- Heuristic algorithms for preemptive scheduling in a Two-stage flowshop with unrelated parallel machines and 0-1 resource requirements
- Autorzy:
- Figielska, E.
- Tematy:
-
preemptive scheduling
flowshop
parallel unrelated machines
resource constraints
heuristics - Pokaż więcej
- Wydawca:
- Polska Akademia Nauk. Instytut Badań Systemowych PAN
- Powiązania:
- https://bibliotekanauki.pl/articles/969665.pdf Link otwiera się w nowym oknie
- Opis:
- The paper considers the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional renewable resources which are available in limited quantities. The resource requirements are of 0-1 type. The objective is minimization of the makespan. The problem is NP-hard. We develop heuristic algorithms which first solve the problem occurring at stage 1, and then find a final schedule in the flowshop. An extensive computational experiment shows that the proposed heuristic algorithms can be an efficient tool capable of finding good quality solutions.
- Dostawca treści:
- Biblioteka Nauki
Artykuł