11 citations · 21 across the 8 of their papers we have counts for
9 papers
On scheduling coupled tasks with exact delays to minimize maximum lateness
Wiesław Kubiak
This paper studies scheduling coupled tasks with exact delays to minimize maximum lateness. The first task has processing time and the second , also the second nee…
On the complexity of open shop scheduling with time lags
Wieslaw Kubiak
The minimization of makespan in open shop with time lags has been shown NP-hard in the strong sense even for the case of two machines and unit-time operations. The minimization of…
On a Conjecture for a Hypergraph Edge Coloring Problem
Wieslaw Kubiak
Let be a hypergraph with two hypervertices and where $\mathcal{M} =\mathcal{G}_{1} \cup \mat…
Shared Processor Scheduling of Multiprocessor Jobs
Dariusz Dereniowski, Wieslaw Kubiak
We study shared processor scheduling of weighted jobs where each job can be executed on its private processor and simultaneously on possibly $\textit{many…
Shared processor scheduling
Dariusz Dereniowski, Wieslaw Kubiak
We study the shared processor scheduling problem with a single shared processor where a unit time saving (weight) obtained by processing a job on the shared processor depends on th…
Shared multi-processor scheduling
Dariusz Dereniowski, Wieslaw Kubiak
We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order…