| 2009 |
|---|
| 20 | EE | Wieslaw Kubiak,
Djamal Rebaine,
Chris Potts:
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors.
Discrete Optimization 6(1): 79-91 (2009) |
| 19 | EE | Joanna Józefowska,
Lukasz Józefowski,
Wieslaw Kubiak:
Apportionment methods and the Liu-Layland problem.
European Journal of Operational Research 193(3): 857-864 (2009) |
| 2008 |
|---|
| 18 | EE | Dominique de Werra,
Tamás Kis,
Wieslaw Kubiak:
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.
J. Scheduling 11(1): 75-83 (2008) |
| 2007 |
|---|
| 17 | EE | Albert Corominas,
Wieslaw Kubiak,
Natalia Moreno Palli:
Response time variability.
J. Scheduling 10(2): 97-110 (2007) |
| 2005 |
|---|
| 16 | EE | Wieslaw Kubiak:
Minimization of ordered, symmetric half-products.
Discrete Applied Mathematics 146(3): 287-300 (2005) |
| 15 | EE | Jinliang Cheng,
Wieslaw Kubiak:
A half-product based approximation scheme for agreeably weighted completion time variance.
European Journal of Operational Research 162(1): 45-54 (2005) |
| 14 | EE | Adam Janiak,
Mikhail Y. Kovalyov,
Wieslaw Kubiak,
Frank Werner:
Positive half-products and scheduling with controllable processing times.
European Journal of Operational Research 165(2): 416-422 (2005) |
| 13 | EE | Wieslaw Kubiak:
Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing.
J. Scheduling 8(4): 295-302 (2005) |
| 2003 |
|---|
| 12 | | Nadia Brauner,
Gerd Finke,
Wieslaw Kubiak:
Complexity of One-Cycle Robotic Flow-Shops.
J. Scheduling 6(4): 355-372 (2003) |
| 2002 |
|---|
| 11 | | Sylvain Gravier,
Daniel Kobler,
Wieslaw Kubiak:
Complexity of list coloring problems with a fixed total number of colors.
Discrete Applied Mathematics 117(1-3): 65-79 (2002) |
| 2000 |
|---|
| 10 | | Jacek Blazewicz,
Maciej Drozdowski,
Piotr Formanowicz,
Wieslaw Kubiak,
Günter Schmidt II:
Scheduling preemptable tasks on parallel processors with limited availability.
Parallel Computing 26(9): 1195-1211 (2000) |
| 1999 |
|---|
| 9 | EE | Moshe Dror,
Gerd Finke,
Sylvain Gravier,
Wieslaw Kubiak:
On the complexity of a restricted list-coloring problem.
Discrete Mathematics 195(1-3): 103-109 (1999) |
| 8 | EE | Moshe Dror,
Wieslaw Kubiak,
Joseph Y.-T. Leung:
Tree Precedence in Scheduling: The Strong-Weak Distinction.
Inf. Process. Lett. 71(3-4): 127-134 (1999) |
| 1998 |
|---|
| 7 | EE | Valery S. Gordon,
Wieslaw Kubiak:
Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs.
Inf. Process. Lett. 68(3): 153-159 (1998) |
| 6 | | Mikhail Y. Kovalyov,
Wieslaw Kubiak:
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs.
J. Heuristics 3(4): 287-297 (1998) |
| 1997 |
|---|
| 5 | EE | Bernd Jurisch,
Wieslaw Kubiak,
Joanna Józefowska:
Algorithms for Minclique Scheduling Problems.
Discrete Applied Mathematics 72(1-2): 115-139 (1997) |
| 4 | EE | Moshe Dror,
Wieslaw Kubiak,
Paolo Dell'Olmo:
Scheduling Chains to Minimize Mean Flow Time.
Inf. Process. Lett. 61(6): 297-301 (1997) |
| 1995 |
|---|
| 3 | EE | Wieslaw Kubiak:
New Results on the Completion Time Variance Minimization.
Discrete Applied Mathematics 58(2): 157-168 (1995) |
| 1993 |
|---|
| 2 | EE | Jacek Blazewicz,
Wieslaw Kubiak,
Silvano Martello:
Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints.
Discrete Applied Mathematics 42(2): 123-138 (1993) |
| 1987 |
|---|
| 1 | | Jacek Blazewicz,
Wieslaw Kubiak,
H. Röck,
Jayme Luiz Szwarcfiter:
Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints.
Acta Inf. 24(5): 513-524 (1987) |
