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...

Full description

Bibliographic Details
Main Author: Ewa Figielska
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
id doaj-793f3778f07f49738d2513966e0ea8fd
record_format Article
spelling doaj-793f3778f07f49738d2513966e0ea8fd2020-11-25T01:40:10ZengWarsaw School of Computer ScienceZeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki1896-396X2082-83492014-12-01811293810.26348/znwwsi.11.29Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource ConstraintsEwa Figielska0Warsaw School of Computer ScienceThe 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.http://zeszyty-naukowe.wwsi.edu.pl/zeszyty/zeszyt11/Algorithms_Using_List_Scheduling_and_Greedy_Strategies.pdfflowshopparallel machinesresource constraintsschedulingheuristic
collection DOAJ
language English
format Article
sources DOAJ
author Ewa Figielska
spellingShingle Ewa Figielska
Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
flowshop
parallel machines
resource constraints
scheduling
heuristic
author_facet Ewa Figielska
author_sort Ewa Figielska
title Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
title_short Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
title_full Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
title_fullStr Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
title_full_unstemmed Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
title_sort algorithms using list scheduling and greedy strategies for scheduling in the flowshop with resource constraints
publisher Warsaw School of Computer Science
series Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
issn 1896-396X
2082-8349
publishDate 2014-12-01
description 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.
topic flowshop
parallel machines
resource constraints
scheduling
heuristic
url http://zeszyty-naukowe.wwsi.edu.pl/zeszyty/zeszyt11/Algorithms_Using_List_Scheduling_and_Greedy_Strategies.pdf
work_keys_str_mv AT ewafigielska algorithmsusinglistschedulingandgreedystrategiesforschedulingintheflowshopwithresourceconstraints
_version_ 1725046725412913152