Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
From MaRDI portal
Publication:5668232
DOI10.1002/nav.3800200107zbMath0254.90021OpenAlexW2155392232MaRDI QIDQ5668232
Sujit K. Dutta, Andrew A. Cunningham
Publication date: 1973
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800200107
Related Items (19)
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 ⋮ On heuristic solutions for the stochastic flowshop scheduling problem ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Heuristic methods and applications: A categorized survey ⋮ Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops ⋮ Minimizing total expected costs in the two-machine, stochastic flow shop ⋮ 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
This page was built for publication: Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
