Wieslaw Kubiak

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