scientific article; zbMATH DE number 502872

DOI<843::AID-NAV3220400608>3.0.CO;2-A 10.1002/1520-6750(199310)40:6<843::AID-NAV3220400608>3.0.CO;2-AzbMath0803.90076MaRDI QIDQ4279265

Panagiotis Kouvelis, Selçuk Karabatı

Publication date: 16 February 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch-and-bound procedurebounding schemenon-preemptive flow shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A bicriteria flowshop scheduling with a learning effect ⋮ A bicriteria approach to the two-machine flow shop scheduling problem ⋮ Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems

Cites Work

• Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
• Unnamed Item