Repozytorium publikacji - Politechnika Gdańska

In the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule). Moreover, in any feasible schedule we require some predetermined delays between the subsequent operations of the same job (no delays in the no-wait restriction) and each machine is working without any idle time (no-idle restriction). Although the open shop scheduling problem is NP-hard in general, we show some polynomial time algorithms using chromatic scheduling models for the selected open shop scheduling problems.

Autorzy

• dr hab. inż. Michał Małafiejski link otwiera się w nowej karcie ,
• mgr inż. Krzysztof Pastuszak link otwiera się w nowej karcie