Wieslaw Kubiak

According to our database1, Wieslaw Kubiak
  • authored at least 56 papers between 1987 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Shared multi-processor scheduling.
European Journal of Operational Research, 2017

Shared processor scheduling.
CoRR, 2017

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

Shared multi-processor scheduling.
CoRR, 2016

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

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

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

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

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

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

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

Transshipment games with identical newsvendors and cooperation costs.
Math. Meth. of OR, 2013

On Transshipment Games with Identical Newsvendors
CoRR, 2013

Minimum length path decompositions
CoRR, 2013

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

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

2010
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines.
J. Scheduling, 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.
European Journal of Operational Research, 2010

Mathematical programming modeling of the Response Time Variability Problem.
European Journal of Operational Research, 2010

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

2009
Apportionment methods and the Liu-Layland problem.
European Journal of Operational Research, 2009

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

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

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

2007
Response time variability.
J. Scheduling, 2007

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

Positive half-products and scheduling with controllable processing times.
European Journal of Operational Research, 2005

A half-product based approximation scheme for agreeably weighted completion time variance.
European Journal of Operational Research, 2005

Minimization of ordered, symmetric half-products.
Discrete Applied Mathematics, 2005

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

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

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

2002
Fast fully polynomial approximation schemes for minimizing completion time variance.
European Journal of Operational Research, 2002

Two-machine flow shops with limited machine availability.
European Journal of Operational Research, 2002

Complexity of list coloring problems with a fixed total number of colors.
Discrete Applied Mathematics, 2002

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

1999
Scheduling identical jobs with chain precedence constraints on two uniform machines.
Math. Meth. of OR, 1999

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

A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem.
Operations Research, 1999

On the complexity of a restricted list-coloring problem.
Discrete Mathematics, 1999

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

1998
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.
Operations Research, 1998

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

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

Two-Machine Open Shops with Renewable Resources.
Operations Research, 1997

Algorithms for Minclique Scheduling Problems.
Discrete Applied Mathematics, 1997

1996
Mean Flow Time Minimization in Reentrant Job Shops with a Hub.
Operations Research, 1996

1995
New Results on the Completion Time Variance Minimization.
Discrete Applied Mathematics, 1995

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

1993
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.
Discrete Applied Mathematics, 1993

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

1989
Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints.
ZOR - Meth. & Mod. of OR, 1989

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


  Loading...