Two-machine flowshop scheduling to minimize mean flow time

MaRDI QIDQ2365765zbMATH OpenFDO

Authors B. V. Cadambi, Y. S. Sathe

Publication date 29 June 1993

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

branch and boundmean flow timetwo-machine flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• scientific article; zbMATH DE number 1247725
• An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
• Two-machine flowshop scheduling with a secondary criterion
• Flowshop/no-idle scheduling to minimise the mean flowtime

Cited in

(18)

• scientific article; zbMATH DE number 4074798 (Why is no real title available?)
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Flowshop/no-idle scheduling to minimise the mean flowtime
• Minmax due-date assignment on a two-machine flowshop
• Inverse scheduling: Two-machine flow-shop problem
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times
• Two-machine flowshop scheduling with job class setups to minimize total flowtime
• A two-machine flowshop problem with two agents
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
• Lower bounds for minimizing total completion time in a two-machine flow shop
• 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

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