An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop

DOI10.1080/00207729608929295zbMath0860.90074OpenAlexW1981545795MaRDI QIDQ4717402

No author found.

Publication date: 1 December 1996

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729608929295

zbMATH Keywords

branch-and-boundlower boundtotal flow timetwo-machine flow-shop schedulingtwo-phase heuristic algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function ⋮ A two-machine flowshop problem with two agents ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times

Cites Work

• Unnamed Item
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• A new heuristic for the n-job, M-machine flow-shop problem
• A dual algorithm for the one-machine scheduling problem
• The Complexity of Flowshop and Jobshop Scheduling
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem