nx2 flowshop sequencing problem with random processing times
From MaRDI portal
Publication:1156082
zbMath0467.90034MaRDI QIDQ1156082
Publication date: 1981
Published in: Opsearch (Search for Journal in Brave)
geometric distributionsrandom processing timesminimization of expected makespannx2 flowshop sequencingoptimal scheduling rule
Related Items (4)
Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function ⋮ A contribution to the stochastic flow shop scheduling problem. ⋮ Minimizing total expected costs in the two-machine, stochastic flow shop ⋮ On three-machine flow shops with random job processing times
This page was built for publication: nx2 flowshop sequencing problem with random processing times
