Two-machine flowshop scheduling to minimize mean flow time
From MaRDI portal
Publication:2365765
zbMath0781.90050MaRDI QIDQ2365765
Publication date: 29 June 1993
Published in: Opsearch (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (9)
Lower bounds for minimizing total completion time in a two-machine flow shop ⋮ The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time ⋮ A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function ⋮ A two-machine flowshop problem with two agents ⋮ The two-machine total completion time flow shop problem ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times ⋮ A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times ⋮ An improved branch-and-bound algorithm for the two machine total completion time flow shop problem ⋮ Two-machine flowshop scheduling with a secondary criterion
This page was built for publication: Two-machine flowshop scheduling to minimize mean flow time
