Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. - Jacek Blazewicz; Wieslaw Kubiak; Hans Röck; Jayme Luiz Szwarcfiter (Acta Informatica, 1987)

Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints. - Wieslaw Kubiak (ZOR Methods Model. Oper. Res., 1989)

Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date. - Nicholas G. Hall; Wieslaw Kubiak; Suresh P. Sethi (Oper. Res., 1991)

Proof of a conjecture of Schrage about the completion time variance problem. - Nicholas G. Hall; Wieslaw Kubiak (Oper. Res. Lett., 1991)

A preemptive open shop scheduling problem with one resource. - Dominique de Werra; Jacek Blazewicz; Wieslaw Kubiak (Oper. Res. Lett., 1991)

Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. - Jacek Blazewicz; Wieslaw Kubiak; Silvano Martello (Discret. Appl. Math., 1993)

Completion time variance minimization on a single machine is difficult. - Wieslaw Kubiak (Oper. Res. Lett., 1993)

Scheduling shops to minimize the weighted number of late jobs. - Joanna Józefowska; Bernd Jurisch; Wieslaw Kubiak (Oper. Res. Lett., 1994)

An efficient algorithm for a job shop problem. - Wieslaw Kubiak; Suresh P. Sethi; Chelliah Sriskandarajah (Ann. Oper. Res., 1995)

New Results on the Completion Time Variance Minimization. - Wieslaw Kubiak (Discret. Appl. Math., 1995)

Mean Flow Time Minimization in Reentrant Job Shops with a Hub. - Wieslaw Kubiak; Sheldon X. C. Lou; Yingmeng Wang (Oper. Res., 1996)

Optimal level schedules for mixed-model, multi-level just-in-time assembly systems. - Wieslaw Kubiak; George Steiner; Julian Scott Yeomans (Ann. Oper. Res., 1997)

Algorithms for Minclique Scheduling Problems. - Bernd Jurisch; Wieslaw Kubiak; Joanna Józefowska (Discret. Appl. Math., 1997)

Two-Machine Open Shops with Renewable Resources. - Bernd Jurisch; Wieslaw Kubiak (Oper. Res., 1997)

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

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

Resource Constrained Chain Scheduling of UET Jobs on Two Machines. - Wieslaw Kubiak; Jacek Blazewicz; Moshe Dror; N. Katoh; Hans Röck (Oper. Res., 1998)

Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs. - Valery S. Gordon; Wieslaw Kubiak (Inf. Process. Lett., 1998)

Scheduling parallel tasks withsequential heads and tails. - Maciej Drozdowski; Wieslaw Kubiak (Ann. Oper. Res., 1999)

On the complexity of a restricted list-coloring problem. - Moshe Dror; Gerd Finke; Sylvain Gravier; Wieslaw Kubiak (Discret. Math., 1999)

A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem. - Mikhail Y. Kovalyov; Wieslaw Kubiak (Oper. Res., 1999)

Tree Precedence in Scheduling: The Strong-Weak Distinction. - Moshe Dror; Wieslaw Kubiak; Joseph Y.-T. Leung (Inf. Process. Lett., 1999)

Scheduling identical jobs with chain precedence constraints on two uniform machines. - Peter Brucker; Johann L. Hurink; Wieslaw Kubiak (Math. Methods Oper. Res., 1999)

Scheduling preemptable tasks on parallel processors with limited availability. - Jacek Blazewicz; Maciej Drozdowski; Piotr Formanowicz; Wieslaw Kubiak; Günter Schmidt 002 (Parallel Comput., 2000)

Complexity of list coloring problems with a fixed total number of colors. - Sylvain Gravier; Daniel Kobler; Wieslaw Kubiak (Discret. Appl. Math., 2002)

Two-machine flow shops with limited machine availability. - Wieslaw Kubiak; Jacek Blazewicz; Piotr Formanowicz; Joachim Breit; Günter Schmidt 002 (Eur. J. Oper. Res., 2002)

Fast fully polynomial approximation schemes for minimizing completion time variance. - Wieslaw Kubiak; Jinliang Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2002)

Cyclic Just-In-Time Sequences Are Optimal. - Wieslaw Kubiak (J. Glob. Optim., 2003)

Complexity of One-Cycle Robotic Flow-Shops. - Nadia Brauner; Gerd Finke; Wieslaw Kubiak (J. Sched., 2003)

Fair Sequences. - Wieslaw Kubiak (Handbook of Scheduling, 2004)

Minimization of ordered, symmetric half-products. - Wieslaw Kubiak (Discret. Appl. Math., 2005)

A half-product based approximation scheme for agreeably weighted completion time variance. - Jinliang Cheng; Wieslaw Kubiak (Eur. J. Oper. Res., 2005)

Positive half-products and scheduling with controllable processing times. - Adam Janiak; Mikhail Y. Kovalyov; Wieslaw Kubiak; Frank Werner 001 (Eur. J. Oper. Res., 2005)

Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing. - Wieslaw Kubiak (J. Sched., 2005)

Response time variability. - Albert Corominas; Wieslaw Kubiak; Natalia Moreno Palli (J. Sched., 2007)

Just-in-Time Smoothing Through Batching. - Wieslaw Kubiak; Mesut Yavuz (Manuf. Serv. Oper. Manag., 2008)

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. - Dominique de Werra; Tamás Kis; Wieslaw Kubiak (J. Sched., 2008)

Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors. - Wieslaw Kubiak; Djamal Rebaine; Chris N. Potts (Discret. Optim., 2009)

Apportionment methods and the Liu-Layland problem. - Joanna Józefowska; Lukasz Józefowski; Wieslaw Kubiak (Eur. J. Oper. Res., 2009)

Transshipment prices and pair-wise stability in coordinating the decentralized transshipment problem. - Behzad Hezarkhani; Wieslaw Kubiak (BQGT, 2010)

Mathematical programming modeling of the Response Time Variability Problem. - Albert Corominas; Wieslaw Kubiak; Rafael Pastor 002 (Eur. J. Oper. Res., 2010)

A coordinating contract for transshipment in a two-company supply chain. - Behzad Hezarkhani; Wieslaw Kubiak (Eur. J. Oper. Res., 2010)

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

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines. - Dariusz Dereniowski; Wieslaw Kubiak (J. Sched., 2010)

An efficient algorithm for finding ideal schedules. - Edward G. Coffman Jr.; Dariusz Dereniowski; Wieslaw Kubiak (Acta Informatica, 2012)

Routing equal-size messages on a slotted ring. - Dariusz Dereniowski; Wieslaw Kubiak (J. Sched., 2012)

Minimum length path decompositions - Dariusz Dereniowski; Wieslaw Kubiak; Yori Zwols (CoRR, 2013)

On Transshipment Games with Identical Newsvendors - Behzad Hezarkhani; Wieslaw Kubiak; Bruce Hartman (CoRR, 2013)

Transshipment games with identical newsvendors and cooperation costs. - Behzad Hezarkhani; Wieslaw Kubiak (Math. Methods Oper. Res., 2013)

Optimal edge-coloring with edge rate constraints. - Dariusz Dereniowski; Wieslaw Kubiak; Bernard Ries; Yori Zwols (Networks, 2013)

A branch and bound algorithm for the response time variability problem. - Alberto García-Villoria; Albert Corominas; Xavier Delorme; Alexandre Dolgui; Wieslaw Kubiak; Rafael Pastor 002 (J. Sched., 2013)

Asymptotic behavior of optimal quantities in symmetric transshipment coalitions. - Behzad Hezarkhani; Wieslaw Kubiak; Bruce Hartman (Oper. Res. Lett., 2014)

Structural Properties of an Open Problem in Preemptive Scheduling. - Bo Chen 002; Ed Coffman; Dariusz Dereniowski; Wieslaw Kubiak (CoRR, 2015)

The complexity of minimum-length path decompositions. - Dariusz Dereniowski; Wieslaw Kubiak; Yori Zwols (J. Comput. Syst. Sci., 2015)

Scheduling semi-malleable jobs to minimize mean flow time. - Yann Hendel; Wieslaw Kubiak; Denis Trystram (J. Sched., 2015)

Decentralized subcontractor scheduling with divisible jobs. - Behzad Hezarkhani; Wieslaw Kubiak (J. Sched., 2015)

Normal-form preemption sequences for an open problem in scheduling theory. - Bo Chen 002; Ed Coffman; Dariusz Dereniowski; Wieslaw Kubiak (J. Sched., 2016)

Shared multi-processor scheduling. - Dariusz Dereniowski; Wieslaw Kubiak (Eur. J. Oper. Res., 2017)

Shared processor scheduling. - Dariusz Dereniowski; Wieslaw Kubiak (J. Sched., 2018)

On a Conjecture for a Hypergraph Edge Coloring Problem. - Wieslaw Kubiak (CoRR, 2020)

Shared processor scheduling of multiprocessor jobs. - Dariusz Dereniowski; Wieslaw Kubiak (Eur. J. Oper. Res., 2020)

On a conjecture for the university timetabling problem. - Wieslaw Kubiak (Discret. Appl. Math., 2021)

A note on scheduling coupled tasks for minimum total completion time. - Wieslaw Kubiak (Ann. Oper. Res., 2023)

On the complexity of open shop scheduling with time lags. - Wieslaw Kubiak (J. Sched., 2023)