Kubiak W.

W. Kubiak

Information about the author W. Kubiak will soon be added to the site.
Found 10 papers in total
Complexity of one-cycle robotic flow-shops
Complexity of one-cycle robotic flow-shops
2003
We study the computational complexity of finding the shortest route the robot should...
Timed Petri nets in modeling and analysis of simple schedules for manufacturing cells
Timed Petri nets in modeling and analysis of simple schedules for manufacturing cells
1999
It is shown that a large class of flexible manufacturing cells can be modeled using...
Scheduling identical jobs with chain precedence constraints in two uniform machines
Scheduling identical jobs with chain precedence constraints in two uniform machines
1999
The problem of scheduling identical jobs with chain precedence constraints on two...
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
1993
The problem the authors consider is that of scheduling n unit length tasks on...
Sequencing of parts and robot moves in a robotic cell
Sequencing of parts and robot moves in a robotic cell
1992
In this paper, the authors deal with the problem of sequencing parts and robot moves...
A note on the complexity of openshop scheduling problems
A note on the complexity of openshop scheduling problems
1991
The authors investigate the complexity of openshop scheduling problems. A number of...
A preemptive open shop scheduling problem with one source
A preemptive open shop scheduling problem with one source
1991
A model for a preemptive open shop scheduling problem is presented and constraints due...
Equivalance of mean flow time problems and mean absolute deviation problems
Equivalance of mean flow time problems and mean absolute deviation problems
1990
The mean flow time problem and the mean absolute deviation problem for multiple...
Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
1989
An O( n 3 /(b+1) ) time algorithm to obtain a minimum finish time schedule...
Scheduling unit-Time tasks on flow-Shops under resource constraints
Scheduling unit-Time tasks on flow-Shops under resource constraints
1988
The authors consider the problem of scheduling tasks on flow shops when each task may...
Papers per page: