Pages that link to "Item:Q3939586"
From MaRDI portal
The following pages link to Minimizing the Expected Makespan in Stochastic Flow Shops (Q3939586):
Displaying 30 items.
- A case for on-machine load balancing (Q635348) (← links)
- On the optimal order of M machines in tandem (Q751991) (← links)
- Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function (Q1129910) (← links)
- A heuristic for determining the optimal order in a tandem queue (Q1186002) (← links)
- Minimizing variation in stochastic flow shop (Q1306384) (← links)
- Optimal order of servers in a tandem queue with general blocking (Q1319852) (← links)
- Scheduling in stochastic flowshops with independent setup, processing and removal times (Q1366705) (← links)
- An aggregation procedure for simulating manufacturing flow line models (Q1374035) (← links)
- Job-shop resource scheduling via simulating random operations (Q1404663) (← links)
- A contribution to the stochastic flow shop scheduling problem. (Q1410626) (← links)
- On three-machine flow shops with random job processing times (Q1580990) (← links)
- Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system (Q1667804) (← links)
- Stochastically minimizing total flowtime in flowshops with no waiting space (Q1806645) (← links)
- Stochastically minimizing the makespan in two-machine flow shops without blocking (Q1806913) (← links)
- Minimizing total expected costs in the two-machine, stochastic flow shop (Q1837103) (← links)
- Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity (Q1887781) (← links)
- Online scheduling of ordered flow shops (Q1991105) (← links)
- Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
- Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops (Q2563865) (← links)
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
- Johnson's problem with stochastic processing times and optimal service level (Q2572849) (← links)
- Characterization of optimal order of servers in a tandem queue with blocking (Q2640249) (← links)
- Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times (Q3200873) (← links)
- Technical note The stochastic flowshop makespan: some further results (Q4230112) (← links)
- Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop (Q4695014) (← links)
- Effect of load, processing time and due date variation on the effectiveness of scheduling rules (Q4706271) (← links)
- Proportionate flow shop: New complexity results and models with due date assignment (Q5249462) (← links)
- Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops (Q5485388) (← links)
- Dynamic scheduling in manufacturing systems using Brownian approximations (Q5955769) (← links)
