On Johnson's Two-Machine Flow Shop with Random Processing Times

From MaRDI portal
Publication:3727729

DOI10.1287/opre.34.1.130zbMath0595.90044OpenAlexW2037856370MaRDI QIDQ3727729

Shun-Chen Niu, Peng-Sheng Ku

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 timesMarkovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacitySchedule execution for two-machine flow-shop with interval processing timesOn the order of tandem queuesScheduling in stochastic flowshops with independent setup, processing and removal timesOn optimizing a bi-objective flowshop scheduling problem in an uncertain environmentStochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing TimesAn aggregation procedure for simulating manufacturing flow line modelsScheduling on a two-machine flowshop subject to random breakdowns with a makespan objective functionSignificantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup timesA contribution to the stochastic flow shop scheduling problem.Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum latenessUncertainty measure for the Bellman-Johnson problem with interval processing timesJob lateness in a two-machine flowshop with setup times separatedMinimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup timesTwo-machine flowshop scheduling problem with bounded processing times to minimize total completion timeA polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing timesStochastically minimizing the makespan in two-machine flow shops without blockingHeuristic for stochastic online flowshop problem with preemption penaltiesMinimizing the Makespan and Flowtime in Two-Machine Stochastic Open ShopsDetermining the optimal sequences and the distributional properties of their completion times in stochastic flow shopsTwo-machine proportionate flowshop scheduling with breakdowns to minimize maximum latenessOn three-machine flow shops with random job processing timesA heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variationJohnson'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