Minimizing the Expected Makespan in Stochastic Flow Shops
From MaRDI portal
Publication:3939586
DOI10.1287/opre.30.1.148zbMath0481.90047OpenAlexW2069497664MaRDI QIDQ3939586
Publication date: 1982
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.30.1.148
permutation flow shop schedulingintermediate storageminimization of expected makespanminimization of completion timeindependent processing timesstochastic flow shops
Related Items
Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity ⋮ Characterization of optimal order of servers in a tandem queue with blocking ⋮ Scheduling in stochastic flowshops with independent setup, processing and removal times ⋮ Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times ⋮ An aggregation procedure for simulating manufacturing flow line models ⋮ Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system ⋮ Two-machine stochastic flow shops with blocking and the traveling salesman problem ⋮ Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function ⋮ Job-shop resource scheduling via simulating random operations ⋮ A contribution to the stochastic flow shop scheduling problem. ⋮ A case for on-machine load balancing ⋮ A heuristic for determining the optimal order in a tandem queue ⋮ Online scheduling of ordered flow shops ⋮ Dynamic scheduling in manufacturing systems using Brownian approximations ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ 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 ⋮ Stochastically minimizing total flowtime in flowshops with no waiting space ⋮ Stochastically minimizing the makespan in two-machine flow shops without blocking ⋮ On the optimal order of M machines in tandem ⋮ Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops ⋮ 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 ⋮ Minimizing total expected costs in the two-machine, stochastic flow shop ⋮ On three-machine flow shops with random job processing times ⋮ Proportionate flow shop: New complexity results and models with due date assignment ⋮ Johnson's problem with stochastic processing times and optimal service level ⋮ Minimizing variation in stochastic flow shop ⋮ Technical note The stochastic flowshop makespan: some further results ⋮ Optimal order of servers in a tandem queue with general blocking
