Search the dblp DataBase
Wieslaw Kubiak :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jacek Blazewicz , Wieslaw Kubiak , H. Röck , Jayme Luiz Szwarcfiter Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1987, v:24, n:5, pp:513-524 [Journal ] Jacek Blazewicz , Wieslaw Kubiak , Silvano Martello Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:42, n:2, pp:123-138 [Journal ] Sylvain Gravier , Daniel Kobler , Wieslaw Kubiak Complexity of list coloring problems with a fixed total number of colors. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:65-79 [Journal ] Bernd Jurisch , Wieslaw Kubiak , Joanna Józefowska Algorithms for Minclique Scheduling Problems. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:115-139 [Journal ] Wieslaw Kubiak Minimization of ordered, symmetric half-products. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:146, n:3, pp:287-300 [Journal ] Wieslaw Kubiak New Results on the Completion Time Variance Minimization. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1995, v:58, n:2, pp:157-168 [Journal ] Mikhail Y. Kovalyov , Wieslaw Kubiak A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. [Citation Graph (0, 0)][DBLP ] J. Heuristics, 1998, v:3, n:4, pp:287-297 [Journal ] Moshe Dror , Wieslaw Kubiak , Paolo Dell'Olmo Scheduling Chains to Minimize Mean Flow Time. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:61, n:6, pp:297-301 [Journal ] Moshe Dror , Wieslaw Kubiak , Joseph Y.-T. Leung Tree Precedence in Scheduling: The Strong-Weak Distinction. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1999, v:71, n:3-4, pp:127-134 [Journal ] Valery Gordon , Wieslaw Kubiak Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:68, n:3, pp:153-159 [Journal ] Jacek Blazewicz , Maciej Drozdowski , Piotr Formanowicz , Wieslaw Kubiak , Günter Schmidt II Scheduling preemptable tasks on parallel processors with limited availability. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 2000, v:26, n:9, pp:1195-1211 [Journal ] Wieslaw Kubiak Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2005, v:8, n:4, pp:295-302 [Journal ] Nadia Brauner , Gerd Finke , Wieslaw Kubiak Complexity of One-Cycle Robotic Flow-Shops. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2003, v:6, n:4, pp:355-372 [Journal ] Albert Corominas , Wieslaw Kubiak , Natalia Moreno Palli Response time variability. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2007, v:10, n:2, pp:97-110 [Journal ] Jinliang Cheng , Wieslaw Kubiak A half-product based approximation scheme for agreeably weighted completion time variance. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:162, n:1, pp:45-54 [Journal ] Adam Janiak , Mikhail Y. Kovalyov , Wieslaw Kubiak , Frank Werner Positive half-products and scheduling with controllable processing times. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:165, n:2, pp:416-422 [Journal ] Moshe Dror , Gerd Finke , Sylvain Gravier , Wieslaw Kubiak On the complexity of a restricted list-coloring problem. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:195, n:1-3, pp:103-109 [Journal ] Search in 0.153secs, Finished in 0.154secs