Wieslaw Kubiak

Alberto García-Villoria, Albert Corominas, Xavier Delorme, Alexandre Dolgui, Wieslaw Kubiak, Rafael Pastor: A branch and bound algorithm for the response time variability problem. J. Scheduling 16(2): 243-252 (2013)

Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols: Minimum length path decompositions. CoRR abs/1302.2788 (2013)

Behzad Hezarkhani, Wieslaw Kubiak, Bruce Hartman: On Transshipment Games with Identical Newsvendors. CoRR abs/1303.5934 (2013)

Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak: An efficient algorithm for finding ideal schedules. Acta Inf. 49(1): 1-14 (2012)

Dariusz Dereniowski, Wieslaw Kubiak: Routing equal-size messages on a slotted ring. J. Scheduling 15(4): 473-486 (2012)

Albert Corominas, Wieslaw Kubiak, Rafael Pastor: Mathematical programming modeling of the Response Time Variability Problem. European Journal of Operational Research 200(2): 347-357 (2010)

Behzad Hezarkhani, Wieslaw Kubiak: A coordinating contract for transshipment in a two-company supply chain. European Journal of Operational Research 207(1): 232-237 (2010)

Tamás Kis, Dominique de Werra, Wieslaw Kubiak: A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. Oper. Res. Lett. 38(2): 129-132 (2010)

Dariusz Dereniowski, Wieslaw Kubiak: Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines. J. Scheduling 13(5): 479-492 (2010)

Wieslaw Kubiak, Djamal Rebaine, Chris N. Potts: Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors. Discrete Optimization 6(1): 79-91 (2009)

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)

Wieslaw Kubiak, Mesut Yavuz: Just-in-Time Smoothing Through Batching. Manufacturing & Service Operations Management 10(3): 506-518 (2008)

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)

Albert Corominas, Wieslaw Kubiak, Natalia Moreno Palli: Response time variability. J. Scheduling 10(2): 97-110 (2007)

Wieslaw Kubiak: Minimization of ordered, symmetric half-products. Discrete Applied Mathematics 146(3): 287-300 (2005)

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)

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)

Wieslaw Kubiak: Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing. J. Scheduling 8(4): 295-302 (2005)

Nadia Brauner, Gerd Finke, Wieslaw Kubiak: Complexity of One-Cycle Robotic Flow-Shops. J. Scheduling 6(4): 355-372 (2003)

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)

Wieslaw Kubiak, Jacek Blazewicz, Piotr Formanowicz, Joachim Breit, Günter Schmidt: Two-machine flow shops with limited machine availability. European Journal of Operational Research 136(3): 528-540 (2002)

Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyov: Fast fully polynomial approximation schemes for minimizing completion time variance. European Journal of Operational Research 137(2): 303-309 (2002)

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)

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)

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)

Peter Brucker, Johann Hurink, Wieslaw Kubiak: Scheduling identical jobs with chain precedence constraints on two uniform machines. Math. Meth. of OR 49(2): 211-219 (1999)

Mikhail Y. Kovalyov, Wieslaw Kubiak: A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. J. Heuristics 3(4): 287-297 (1998)

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)

Bernd Jurisch, Wieslaw Kubiak, Joanna Józefowska: Algorithms for Minclique Scheduling Problems. Discrete Applied Mathematics 72(1-2): 115-139 (1997)

Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo: Scheduling Chains to Minimize Mean Flow Time. Inf. Process. Lett. 61(6): 297-301 (1997)

Wieslaw Kubiak: New Results on the Completion Time Variance Minimization. Discrete Applied Mathematics 58(2): 157-168 (1995)

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)

Jacek Blazewicz, Wieslaw Kubiak, Hans Röck, Jayme Luiz Szwarcfiter: Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. Acta Inf. 24(5): 513-524 (1987)