Kubiak Wieslaw

Wieslaw Kubiak

Information about the author Wieslaw Kubiak will soon be added to the site.
Found 32 papers in total
Transshipment games with identical newsvendors and cooperation costs
Transshipment games with identical newsvendors and cooperation costs
2013
In a transshipment game, supply chain agents cooperate to transship surplus products....
A branch and bound algorithm for the response time variability problem
A branch and bound algorithm for the response time variability problem
2013
The response time variability problem (RTVP) is an NP‐hard scheduling problem...
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
2010
We study a multiprocessor extension of the preemptive open shop scheduling problem,...
Just-in-Time Smoothing Through Batching
Just-in-Time Smoothing Through Batching
2008
This paper presents two methods to solve the production smoothing problem in...
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
2008
This paper addresses a multiprocessor generalization of the preemptive open-shop...
Response time variability
Response time variability
2007
Response time variability is a new optimization problem with a broad range of...
Solution of the Liu–Layland problem via bottleneck just-in-time sequencing
Solution of the Liu–Layland problem via bottleneck just-in-time sequencing
2005
This paper proposes a new approach to the well-known Liu–Layland periodic...
Positive half-products and scheduling with controllable processing times
Positive half-products and scheduling with controllable processing times
2005
We study the single machine scheduling problem with controllable job processing times...
A half-product based approximation scheme for agreeably weighted completion time variance
A half-product based approximation scheme for agreeably weighted completion time variance
2005
A recent INFORMS Journal on Computing paper presents a fully polynomial time...
Scheduling chains on uniform processors with communication delays
Scheduling chains on uniform processors with communication delays
2002
We show that the problem of scheduling chains of unit execution time (UET) jobs on...
Two-machine flow shops with limited machine availability
Two-machine flow shops with limited machine availability
2002
This paper studies a flow shop where machines have some periods of limited...
A computational analysis of balanced just-in-time optimization algorithms
A computational analysis of balanced just-in-time optimization algorithms
2001
The balanced schedule problem in mixed-model, JIT manufacturing is examined. Solving...
A fully polynomial approximation scheme for the weighted earliness–tardiness problem
A fully polynomial approximation scheme for the weighted earliness–tardiness problem
1999
A fully polynomial approximation scheme for the problem of scheduling n jobs on a...
A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
1997
A fully polynomial approximation scheme for the problem of scheduling n deteriorating...
Mean flow time minimization in reentrant job shops with a hub
Mean flow time minimization in reentrant job shops with a hub
1996
This paper considers a reentrant job shop with one hub machine which a job enters K...
Two-machine open shops with renewable resources
Two-machine open shops with renewable resources
1997
In open shops with renewable resources, an operation may require additional resources,...
Resource constrained chain scheduling of unit execution time jobs on two machines
Resource constrained chain scheduling of unit execution time jobs on two machines
1998
A well-known technique for solving scheduling problems with two identical parallel...
‘Strong’–‘weak’ chain constrained scheduling
‘Strong’–‘weak’ chain constrained scheduling
1997
In this paper we introduce a distinction between the weak and strong modes of...
Scheduling deteriorating jobs to minimize makespan
Scheduling deteriorating jobs to minimize makespan
1998
We consider a single-machine problem of scheduling n independent jobs to minimize...
Total completion time minimization in two-machine job shops with unit time operations
Total completion time minimization in two-machine job shops with unit time operations
1996
We study the problem of minimizing total completion time in two-machine job shop with...
Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
1994
The ultimate purpose of the present analysis is to show that for any class of linear...
Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
1997
Solving the level (or balanced) schedule problem is the most important scheduling goal...
New results on the completion time variance minimization
New results on the completion time variance minimization
1995
A single machine scheduling problem where the objective is to minimize the variance of...
Scheduling shops to minimize the weighted number of late jobs
Scheduling shops to minimize the weighted number of late jobs
1994
The problem of scheduling jobs with a common due date d so that the weighted number of...
Papers per page: