Minimizing the Expected Makespan in Stochastic Flow Shops
From MaRDI portal
Cited in
(31)- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
- A heuristic for determining the optimal order in a tandem queue
- Minimizing variation in stochastic flow shop
- Optimal order of servers in a tandem queue with general blocking
- Scheduling in stochastic flowshops with independent setup, processing and removal times
- An aggregation procedure for simulating manufacturing flow line models
- Job-shop resource scheduling via simulating random operations
- A contribution to the stochastic flow shop scheduling problem.
- On three-machine flow shops with random job processing times
- Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system
- Stochastically minimizing total flowtime in flowshops with no waiting space
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Minimizing total expected costs in the two-machine, stochastic flow shop
- Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity
- Online scheduling of ordered flow shops
- Flow shops with reentry: reversibility properties and makespan optimal schedules
- 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
- Johnson's problem with stochastic processing times and optimal service level
- Characterization of optimal order of servers in a tandem queue with blocking
- Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times
- Technical note The stochastic flowshop makespan: some further results
- Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop
- Effect of load, processing time and due date variation on the effectiveness of scheduling rules
- Proportionate flow shop: new complexity results and models with due date assignment
- Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops
- Dynamic scheduling in manufacturing systems using Brownian approximations
- A case for on-machine load balancing
- Fifty years of research in scheduling -- theory and applications
- On the optimal order of M machines in tandem
- Two-machine stochastic flow shops with blocking and the traveling salesman problem
This page was built for publication: Minimizing the Expected Makespan in Stochastic Flow Shops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3939586)
