The following pages link to Jerzy Kamburowski (Q859678):
Displayed 49 items.
- On no-wait and no-idle flow shops with makespan criterion (Q859679) (← links)
- Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- An upper bound on the expected completion time of PERT networks (Q1060947) (← links)
- (Q1111458) (redirect page) (← links)
- Congested network flows: Time-varying demands and start-time policies (Q1111459) (← links)
- The use of fuzzy variables in PERT (Q1148224) (← links)
- Investments in stochastic maximum flow networks (Q1176860) (← links)
- Bounding the distribution of project duration in PERT networks (Q1200756) (← links)
- Estimating the mean completion time of PERT networks with exponentially distributed durations of activities (Q1319548) (← links)
- On three-machine flow shops with random job processing times (Q1580990) (← links)
- Non-bottleneck machines in three-machine flow shops (Q1585915) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- On the distribution-free newsboy problem with some non-skewed demands (Q1785632) (← links)
- Stochastically minimizing the makespan in two-machine flow shops without blocking (Q1806913) (← links)
- Optimal resource profiles for program scheduling (Q1821025) (← links)
- Finding the most vital arcs in a network (Q1823164) (← links)
- On forwarding indices of networks (Q1823868) (← links)
- Risk taking in stochastic PERT networks (Q2367367) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- The distribution-free newsboy problem under the worst-case and best-case scenarios (Q2514815) (← links)
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847) (← links)
- Corrigendum to: ``The distribution-free newsboy problem under the worst-case and best-case scenarios'' (Q2629632) (← links)
- The distribution-free newsboy problem and the demand skew (Q2806440) (← links)
- (Q2997911) (← links)
- (Q3197607) (← links)
- (Q3323685) (← links)
- Some remarks on the expected delay of project duration in a PERT network (Q3346077) (← links)
- (Q3683884) (← links)
- Technical Note—A Note on the Stochastic Shortest Route Problem (Q3685539) (← links)
- (Q3690569) (← links)
- (Q3691403) (← links)
- Two-point approximations for activity times in PERT networks (Q3693242) (← links)
- Normally Distributed Activity Durations in PERT Networks (Q3703643) (← links)
- (Q3727727) (← links)
- (Q3731391) (← links)
- (Q3741395) (← links)
- A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration (Q3757672) (← links)
- (Q3792464) (← links)
- (Q3892053) (← links)
- Minimum flows in (s,t) planar networks (Q3984281) (← links)
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs) (Q4015267) (← links)
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs (Q4027859) (← links)
- (Q4030448) (← links)
- On the minimum dummy-arc problem (Q4201824) (← links)
- (Q4509382) (← links)
- Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops (Q4678208) (← links)
- (Q4726020) (← links)
- Bounds on the mean of the maximum of a number of normal random variables (Q4730537) (← links)