Kamburowski Jerzy

Jerzy Kamburowski

Information about the author Jerzy Kamburowski will soon be added to the site.
Found 13 papers in total
The distribution-free newsboy problem and the demand skew
The distribution-free newsboy problem and the demand skew
2015
We consider the newsboy problem when the information about the probability...
On no-wait and no-idle flowshops with makespan criterion
On no-wait and no-idle flowshops with makespan criterion
2007
The paper deals with the NP-hard problems of minimizing the makespan in m -machine...
Two-machine stochastic flow shops with blocking and the traveling salesman problem
Two-machine stochastic flow shops with blocking and the traveling salesman problem
2005
The paper deals with the problem of minimizing the expected makespan in a two-machine...
On the NEH (Nawaz, Enscore, and Ham) heuristic for minimizing the makespan in permutation flow shops
On the NEH (Nawaz, Enscore, and Ham) heuristic for minimizing the makespan in permutation flow shops
2007
Over the last 20 years the NEH heuristic of Nawaz, Enscore, and Ham published in this...
A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
2006
The paper deals with the classical problem of minimizing the makespan in a two-machine...
A heuristic for minimizing the makespan in no-idle permutation flow shops
A heuristic for minimizing the makespan in no-idle permutation flow shops
2005
The paper deals with the problem of finding a job sequence that minimizes the makespan...
More on three-machine no-idle flow shops
More on three-machine no-idle flow shops
2004
Recently Saadani, Guinet, and Moalla considered the NP-hard problem of minimizing the...
Non-bottleneck machines in three-machine flow shops
Non-bottleneck machines in three-machine flow shops
2000
The paper deals with the classical problem of minimizing the makespan in a...
On three-machine flow shops with random job processing times
On three-machine flow shops with random job processing times
2000
The paper deals with scheduling n jobs on three machines in Johnson's flow shops. The...
Stochastically minimizing the makespan in two-machine flow shops without blocking
Stochastically minimizing the makespan in two-machine flow shops without blocking
1999
This paper deals with a two-machine stochastic flow shop with an infinite storage...
On the minimum dummy-arc problem
On the minimum dummy-arc problem
1993
A precedence relation can be represented non-uniquely by an activity on arc (AoA)...
The analysis of activity networks under generalized precedence relations (GPRs)
The analysis of activity networks under generalized precedence relations (GPRs)
1992
The authors present a model for activity networks under generalized precedence...
Bounding the distribution of project duration in PERT networks
Bounding the distribution of project duration in PERT networks
1992
The PERT model of a project composed of m activities whose durations are independent...
Papers per page: