Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Figielska E.

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: parallel unrelated machines

Sortuj według:

Ogranicz wyniki do:

Heuristic algorithms for preemptive scheduling in a Two-stage flowshop with unrelated parallel machines and 0-1 resource requirements

Figielska E.

Control and Cybernetics

2009

Vol. 38, no 3

723-743

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.

Solving a flowshop scheduling problem with additional resource constraints

Figielska E.

Prace Naukowe Politechniki Warszawskiej. Elektronika

2006

z. 156

139-146

The paper considers the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machinne at the second stage. At the first stage jobs require some amounts of additional renewable resources. The objective is the minimization of the makespan. The problem is NP-hard. A heuristic which combines column generation technique with a genetic algorithm is proposed. Several problems with randomly generated parameters are solved. The results indicate that the heuristic is a promising tool for solving the considered problem.