On Johnson's Two-Machine Flow Shop with Random Processing Times
From MaRDI portal
Recommendations
- Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops
- scientific article; zbMATH DE number 5856053
- A Probabilistic Analysis of Two-Machine Flowshops
- On three-machine flow shops with random job processing times
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
- Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times
- scientific article; zbMATH DE number 3974704
- The two-machine permutation flow shop with state-dependent processing times
- Two-machine ordered flowshop scheduling under random breakdowns
Cited in
(32)- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
- Job lateness in a two-machine flowshop with setup times separated
- Scheduling in stochastic flowshops with independent setup, processing and removal times
- An aggregation procedure for simulating manufacturing flow line models
- A contribution to the stochastic flow shop scheduling problem.
- On three-machine flow shops with random job processing times
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity
- On the order of tandem queues
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
- Heuristic for stochastic online flowshop problem with preemption penalties
- Schedule execution for two-machine flow-shop with interval processing times
- Uncertainty measure for the Bellman-Johnson problem with interval processing times
- Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
- Johnson's problem with stochastic processing times and optimal service level
- scientific article; zbMATH DE number 5856053 (Why is no real title available?)
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
- Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times
- On optimizing a bi-objective flowshop scheduling problem in an uncertain environment
- scientific article; zbMATH DE number 3974704 (Why is no real title available?)
- Inequalities for stochastic flow shops and job shops
- A Probabilistic Analysis of Two-Machine Flowshops
- A generalized Johnson's rule for stochastic assembly systems
- Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops
- Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops
- Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times
- Fifty years of research in scheduling -- theory and applications
- Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
This page was built for publication: On Johnson's Two-Machine Flow Shop with Random Processing Times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3727729)
