Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints

• Autorzy: Figielska E.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

flowshop; parallel machines; resource constraints; scheduling; heuristic

• Wydawca: Warszawska Wyższa Szkoła Informatyki
• Czasopismo: Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
• Rocznik: 2014
• Tom: nr 11
• Strony: 29--39
• Opis fizyczny: Bibliogr. 5 poz., tab.

Twórcy

autor

Figielska E.

• Warsaw School of Computer Science

Bibliografia

• [1] E. Figielska. A new heuristic for scheduling the two-stage flowshop with additional resources, Computers & Industrial Engineering 54, 750-763, 2008.
• [2] E. Figielska. Linear programming & metaheuristic approach for scheduling in the hybrid flowshop with resource constraints. Control and Cybernetics 40 (4), 1209-1230, 2011.
• [3] E. Figielska. A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources, Computers &Industrial Engineering 56, 142-151, 2009.
• [4] E. Figielska. A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages, European Journal of Operational Research 236(2), 433–444, 2014.
• [5] S.M. Johnson. Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly 1, 61-68, 1954.