Kubiak Wieslaw

Wieslaw Kubiak

Information about the author Wieslaw Kubiak will soon be added to the site.
Found 32 papers in total
Minimizing variation of production rates in just-in-time systems: A survey
Minimizing variation of production rates in just-in-time systems: A survey
1993
In the past several years, there has been growing interest in scheduling problems...
An efficient algorithm for a job shop problem
An efficient algorithm for a job shop problem
1995
The authors study the problem of minimizing makespan in a two-machine job shop with...
Optimal just-in-time schedules for flexible transfer lines
Optimal just-in-time schedules for flexible transfer lines
1994
Flexible transfer lines or mixed-model assembly lines are capable of diversified...
Completion time variance minimization on a single machine is difficult
Completion time variance minimization on a single machine is difficult
1993
The complexity of the completion time variance minimization (CTV) problem on a single...
Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date
Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date
1991
A compansion paper (Part I) considers the problem of minimizing the weighted earliness...
Proof of a conjecture of Schrage about the completion time variance problem
Proof of a conjecture of Schrage about the completion time variance problem
1991
The problem of minimizing the completion time variance of n jobs on a single machine...
A note on ‘Level schedules for mixed-model assembly lines in just-in-time production systems’
A note on ‘Level schedules for mixed-model assembly lines in just-in-time production systems’
1991
This note formulates an assignment problem for obtaining optimal level schedules for...
A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
1989
An O( n 5 N) algorithm is proposed for the n- job problem 2/ n/J, no-wait, pt ji =1/C...
Papers per page: