nx2 flowshop sequencing problem with random processing times

MaRDI QIDQ1156082zbMATH OpenFDO

Authors V. Rajendra Prasad

Publication date 1981

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

random processing timesgeometric distributionsminimization of expected makespannx2 flowshop sequencingoptimal scheduling rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(4)

• On three-machine flow shops with random job processing times
• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• Minimizing total expected costs in the two-machine, stochastic flow shop
• A contribution to the stochastic flow shop scheduling problem.

This page was built for publication: nx2 flowshop sequencing problem with random processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156082)