Wieslaw Kubiak

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 12

Top Topics

Preemptive Scheduling

Open Shop Scheduling

Weighted Tardiness

Top Venues

Eur. J. Oper. Res.

Oper. Res. Lett.

Publications

Wieslaw Kubiak
A note on scheduling coupled tasks for minimum total completion time. Ann. Oper. Res. 320 (1) (2023)
Wieslaw Kubiak
On the complexity of open shop scheduling with time lags. J. Sched. 26 (3) (2023)
Wieslaw Kubiak
On a conjecture for the university timetabling problem. Discret. Appl. Math. 299 (2021)
Wieslaw Kubiak
On the complexity of open shop scheduling with time lags. CoRR (2021)
Dariusz Dereniowski, Wieslaw Kubiak
Shared processor scheduling of multiprocessor jobs. Eur. J. Oper. Res. 282 (2) (2020)
Wieslaw Kubiak
On a Conjecture for a Hypergraph Edge Coloring Problem. CoRR (2020)
Dariusz Dereniowski, Wieslaw Kubiak
Shared processor scheduling. J. Sched. 21 (6) (2018)
Dariusz Dereniowski, Wieslaw Kubiak
Shared Processor Scheduling of Multiprocessor Jobs. CoRR (2018)
Dariusz Dereniowski, Wieslaw Kubiak
Shared processor scheduling. CoRR (2017)
Dariusz Dereniowski, Wieslaw Kubiak
Shared multi-processor scheduling. Eur. J. Oper. Res. 261 (2) (2017)
Dariusz Dereniowski, Wieslaw Kubiak
Shared multi-processor scheduling. CoRR (2016)
Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak
Normal-form preemption sequences for an open problem in scheduling theory. J. Sched. 19 (6) (2016)
Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols
The complexity of minimum-length path decompositions. J. Comput. Syst. Sci. 81 (8) (2015)
Behzad Hezarkhani, Wieslaw Kubiak
Decentralized subcontractor scheduling with divisible jobs. J. Sched. 18 (5) (2015)
Yann Hendel, Wieslaw Kubiak, Denis Trystram
Scheduling semi-malleable jobs to minimize mean flow time. J. Sched. 18 (4) (2015)
Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak
Structural Properties of an Open Problem in Preemptive Scheduling. CoRR (2015)
Behzad Hezarkhani, Wieslaw Kubiak, Bruce Hartman
Asymptotic behavior of optimal quantities in symmetric transshipment coalitions. Oper. Res. Lett. 42 (6-7) (2014)
Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols
Optimal edge-coloring with edge rate constraints. Networks 62 (3) (2013)
Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols
Minimum length path decompositions CoRR (2013)
Behzad Hezarkhani, Wieslaw Kubiak
Transshipment games with identical newsvendors and cooperation costs. Math. Methods Oper. Res. 78 (3) (2013)
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. Sched. 16 (2) (2013)
Behzad Hezarkhani, Wieslaw Kubiak, Bruce Hartman
On Transshipment Games with Identical Newsvendors CoRR (2013)
Dariusz Dereniowski, Wieslaw Kubiak
Routing equal-size messages on a slotted ring. J. Sched. 15 (4) (2012)
Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak
An efficient algorithm for finding ideal schedules. Acta Informatica 49 (1) (2012)
Behzad Hezarkhani, Wieslaw Kubiak
A coordinating contract for transshipment in a two-company supply chain. Eur. J. Oper. Res. 207 (1) (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) (2010)
Albert Corominas, Wieslaw Kubiak, Rafael Pastor
Mathematical programming modeling of the Response Time Variability Problem. Eur. J. Oper. Res. 200 (2) (2010)
Behzad Hezarkhani, Wieslaw Kubiak
Transshipment prices and pair-wise stability in coordinating the decentralized transshipment problem. BQGT (2010)
Dariusz Dereniowski, Wieslaw Kubiak
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines. J. Sched. 13 (5) (2010)
Wieslaw Kubiak, Djamal Rebaine, Chris N. Potts
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors. Discret. Optim. 6 (1) (2009)
Joanna Józefowska, Lukasz Józefowski, Wieslaw Kubiak
Apportionment methods and the Liu-Layland problem. Eur. J. Oper. Res. 193 (3) (2009)
Wieslaw Kubiak, Mesut Yavuz
Just-in-Time Smoothing Through Batching. Manuf. Serv. Oper. Manag. 10 (3) (2008)
Dominique de Werra, Tamás Kis, Wieslaw Kubiak
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. J. Sched. 11 (1) (2008)
Albert Corominas, Wieslaw Kubiak, Natalia Moreno Palli
Response time variability. J. Sched. 10 (2) (2007)
Jinliang Cheng, Wieslaw Kubiak
A half-product based approximation scheme for agreeably weighted completion time variance. Eur. J. Oper. Res. 162 (1) (2005)
Wieslaw Kubiak
Minimization of ordered, symmetric half-products. Discret. Appl. Math. 146 (3) (2005)
Wieslaw Kubiak
Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing. J. Sched. 8 (4) (2005)
Adam Janiak, Mikhail Y. Kovalyov, Wieslaw Kubiak, Frank Werner
Positive half-products and scheduling with controllable processing times. Eur. J. Oper. Res. 165 (2) (2005)
Wieslaw Kubiak
Cyclic Just-In-Time Sequences Are Optimal. J. Glob. Optim. 27 (2-3) (2003)
Nadia Brauner, Gerd Finke, Wieslaw Kubiak
Complexity of One-Cycle Robotic Flow-Shops. J. Sched. 6 (4) (2003)
Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyov
Fast fully polynomial approximation schemes for minimizing completion time variance. Eur. J. Oper. Res. 137 (2) (2002)
Sylvain Gravier, Daniel Kobler, Wieslaw Kubiak
Complexity of list coloring problems with a fixed total number of colors. Discret. Appl. Math. 117 (1-3) (2002)
Wieslaw Kubiak, Jacek Blazewicz, Piotr Formanowicz, Joachim Breit, Günter Schmidt
Two-machine flow shops with limited machine availability. Eur. J. Oper. Res. 136 (3) (2002)
Jacek Blazewicz, Maciej Drozdowski, Piotr Formanowicz, Wieslaw Kubiak, Günter Schmidt
Scheduling preemptable tasks on parallel processors with limited availability. Parallel Comput. 26 (9) (2000)
Maciej Drozdowski, Wieslaw Kubiak
Scheduling parallel tasks withsequential heads and tails. Ann. Oper. Res. 90 (1999)
Moshe Dror, Wieslaw Kubiak, Joseph Y.-T. Leung
Tree Precedence in Scheduling: The Strong-Weak Distinction. Inf. Process. Lett. 71 (3-4) (1999)
Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak
On the complexity of a restricted list-coloring problem. Discret. Math. 195 (1-3) (1999)
Peter Brucker, Johann L. Hurink, Wieslaw Kubiak
Scheduling identical jobs with chain precedence constraints on two uniform machines. Math. Methods Oper. Res. 49 (2) (1999)
Mikhail Y. Kovalyov, Wieslaw Kubiak
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem. Oper. Res. 47 (5) (1999)
Mikhail Y. Kovalyov, Wieslaw Kubiak
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. J. Heuristics 3 (4) (1998)
Wieslaw Kubiak, Jacek Blazewicz, Moshe Dror, N. Katoh, Hans Röck
Resource Constrained Chain Scheduling of UET Jobs on Two Machines. Oper. Res. 46 (5) (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) (1998)
Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo
Scheduling Chains to Minimize Mean Flow Time. Inf. Process. Lett. 61 (6) (1997)
Wieslaw Kubiak, George Steiner, Julian Scott Yeomans
Optimal level schedules for mixed-model, multi-level just-in-time assembly systems. Ann. Oper. Res. 69 (1997)
Bernd Jurisch, Wieslaw Kubiak, Joanna Józefowska
Algorithms for Minclique Scheduling Problems. Discret. Appl. Math. 72 (1-2) (1997)
Bernd Jurisch, Wieslaw Kubiak
Two-Machine Open Shops with Renewable Resources. Oper. Res. 45 (4) (1997)
Wieslaw Kubiak, Sheldon X. C. Lou, Yingmeng Wang
Mean Flow Time Minimization in Reentrant Job Shops with a Hub. Oper. Res. 44 (5) (1996)
Wieslaw Kubiak, Suresh P. Sethi, Chelliah Sriskandarajah
An efficient algorithm for a job shop problem. Ann. Oper. Res. 57 (1) (1995)
Wieslaw Kubiak
New Results on the Completion Time Variance Minimization. Discret. Appl. Math. 58 (2) (1995)
Joanna Józefowska, Bernd Jurisch, Wieslaw Kubiak
Scheduling shops to minimize the weighted number of late jobs. Oper. Res. Lett. 16 (5) (1994)
Jacek Blazewicz, Wieslaw Kubiak, Silvano Martello
Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. Discret. Appl. Math. 42 (2) (1993)
Wieslaw Kubiak
Completion time variance minimization on a single machine is difficult. Oper. Res. Lett. 14 (1) (1993)
Dominique de Werra, Jacek Blazewicz, Wieslaw Kubiak
A preemptive open shop scheduling problem with one resource. Oper. Res. Lett. 10 (1) (1991)
Nicholas G. Hall, Wieslaw Kubiak
Proof of a conjecture of Schrage about the completion time variance problem. Oper. Res. Lett. 10 (8) (1991)
Nicholas G. Hall, Wieslaw Kubiak, Suresh P. Sethi
Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date. Oper. Res. 39 (5) (1991)
Wieslaw Kubiak
Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints. ZOR Methods Model. Oper. Res. 33 (6) (1989)
Jacek Blazewicz, Wieslaw Kubiak, Hans Röck, Jayme Luiz Szwarcfiter
Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. Acta Informatica 24 (5) (1987)