Wieslaw Kubiak

According to our database1, Wieslaw Kubiak authored at least 61 papers between 1987 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Shared processor scheduling of multiprocessor jobs.
Eur. J. Oper. Res., 2020

On a Conjecture for a Hypergraph Edge Coloring Problem.
CoRR, 2020

Shared processor scheduling.
J. Sched., 2018

Shared multi-processor scheduling.
Eur. J. Oper. Res., 2017

Normal-form preemption sequences for an open problem in scheduling theory.
J. Sched., 2016

Decentralized subcontractor scheduling with divisible jobs.
J. Sched., 2015

Scheduling semi-malleable jobs to minimize mean flow time.
J. Sched., 2015

The complexity of minimum-length path decompositions.
J. Comput. Syst. Sci., 2015

Structural Properties of an Open Problem in Preemptive Scheduling.
CoRR, 2015

Asymptotic behavior of optimal quantities in symmetric transshipment coalitions.
Oper. Res. Lett., 2014

A branch and bound algorithm for the response time variability problem.
J. Sched., 2013

Optimal edge-coloring with edge rate constraints.
Networks, 2013

Transshipment games with identical newsvendors and cooperation costs.
Math. Methods Oper. Res., 2013

On Transshipment Games with Identical Newsvendors
CoRR, 2013

Minimum length path decompositions
CoRR, 2013

Routing equal-size messages on a slotted ring.
J. Sched., 2012

An efficient algorithm for finding ideal schedules.
Acta Informatica, 2012

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines.
J. Sched., 2010

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups.
Oper. Res. Lett., 2010

A coordinating contract for transshipment in a two-company supply chain.
Eur. J. Oper. Res., 2010

Mathematical programming modeling of the Response Time Variability Problem.
Eur. J. Oper. Res., 2010

Transshipment prices and pair-wise stability in coordinating the decentralized transshipment problem.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

Apportionment methods and the Liu-Layland problem.
Eur. J. Oper. Res., 2009

Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors.
Discret. Optim., 2009

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications.
J. Sched., 2008

Just-in-Time Smoothing Through Batching.
Manufacturing & Service Operations Management, 2008

Response time variability.
J. Sched., 2007

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

Positive half-products and scheduling with controllable processing times.
Eur. J. Oper. Res., 2005

A half-product based approximation scheme for agreeably weighted completion time variance.
Eur. J. Oper. Res., 2005

Minimization of ordered, symmetric half-products.
Discret. Appl. Math., 2005

Fair Sequences.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Complexity of One-Cycle Robotic Flow-Shops.
J. Sched., 2003

Cyclic Just-In-Time Sequences Are Optimal.
J. Global Optimization, 2003

Fast fully polynomial approximation schemes for minimizing completion time variance.
Eur. J. Oper. Res., 2002

Two-machine flow shops with limited machine availability.
Eur. J. Oper. Res., 2002

Complexity of list coloring problems with a fixed total number of colors.
Discret. Appl. Math., 2002

Scheduling preemptable tasks on parallel processors with limited availability.
Parallel Comput., 2000

Scheduling identical jobs with chain precedence constraints on two uniform machines.
Math. Methods Oper. Res., 1999

Tree Precedence in Scheduling: The Strong-Weak Distinction.
Inf. Process. Lett., 1999

A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem.
Oper. Res., 1999

On the complexity of a restricted list-coloring problem.
Discret. Math., 1999

Scheduling parallel tasks withsequential heads and tails.
Annals OR, 1999

Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs.
Inf. Process. Lett., 1998

Resource Constrained Chain Scheduling of UET Jobs on Two Machines.
Oper. Res., 1998

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs.
J. Heuristics, 1998

Scheduling Chains to Minimize Mean Flow Time.
Inf. Process. Lett., 1997

Two-Machine Open Shops with Renewable Resources.
Oper. Res., 1997

Algorithms for Minclique Scheduling Problems.
Discret. Appl. Math., 1997

Optimal level schedules for mixed-model, multi-level just-in-time assembly systems.
Annals OR, 1997

Mean Flow Time Minimization in Reentrant Job Shops with a Hub.
Oper. Res., 1996

New Results on the Completion Time Variance Minimization.
Discret. Appl. Math., 1995

An efficient algorithm for a job shop problem.
Annals OR, 1995

Scheduling shops to minimize the weighted number of late jobs.
Oper. Res. Lett., 1994

Completion time variance minimization on a single machine is difficult.
Oper. Res. Lett., 1993

Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints.
Discret. Appl. Math., 1993

A preemptive open shop scheduling problem with one resource.
Oper. Res. Lett., 1991

Proof of a conjecture of Schrage about the completion time variance problem.
Oper. Res. Lett., 1991

Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date.
Oper. Res., 1991

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

Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints.
Acta Informatica, 1987