On Johnson's Two-Machine Flow Shop with Random Processing Times
From MaRDI portal
Publication:3727729
DOI10.1287/opre.34.1.130zbMath0595.90044OpenAlexW2037856370MaRDI QIDQ3727729
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.34.1.130
Related Items (25)
Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity ⋮ Schedule execution for two-machine flow-shop with interval processing times ⋮ On the order of tandem queues ⋮ Scheduling in stochastic flowshops with independent setup, processing and removal times ⋮ On optimizing a bi-objective flowshop scheduling problem in an uncertain environment ⋮ Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times ⋮ An aggregation procedure for simulating manufacturing flow line models ⋮ Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function ⋮ Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times ⋮ A contribution to the stochastic flow shop scheduling problem. ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ Uncertainty measure for the Bellman-Johnson problem with interval processing times ⋮ Job lateness in a two-machine flowshop with setup times separated ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time ⋮ 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 ⋮ Heuristic for stochastic online flowshop problem with preemption penalties ⋮ 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 ⋮ On three-machine flow shops with random job processing times ⋮ 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
This page was built for publication: On Johnson's Two-Machine Flow Shop with Random Processing Times
