scientific article; zbMATH DE number 1091396

zbMATH Open0887.90087MaRDI QIDQ4367129FDOQ4367129

Authors: Sixiang Hou, Donglei Du 

Publication date: 8 December 1997

Title of this publication is not available (Why is that?)

Recommendations

• A New Heuristic for Three-Machine Flow Shop Scheduling
• A worst-case analysis of the three-machine flow shop scheduling
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• scientific article; zbMATH DE number 3896632
• A Note on Heuristics of Flow-Shop Scheduling

zbMATH Keywords

heuristicworst-case analysistwo-machine flow shopautomated manufacturingthree-machine flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (3)

• The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items
• Title not available (Why is that?)
• The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems

This page was built for publication:

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