scientific article; zbMATH DE number 1462947

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(200004)47:3<259::AID-NAV5>3.0.CO;2-K" /><259::AID-NAV5>3.0.CO;2-K 10.1002/(SICI)1520-6750(200004)47:3<259::AID-NAV5>3.0.CO;2-KzbMath0956.90009MaRDI QIDQ4487091

Kyparisis, George J., Christos P. Koulamas

Publication date: 21 June 2000

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

zbMATH Keywords

linear time algorithmstwo-stage and three-stage flexible flow shops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling of a single crane in batch annealing process ⋮ Flexible flow shop scheduling with uniform parallel machines ⋮ Performance guarantees for flowshop heuristics to minimize makespan

Cites Work

• Unnamed Item
• Branch and bound algorithm for the flow shop with multiple processors
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• On some geometric methods in scheduling theory: A survey
• Minimizing makespan in hybrid flowshops
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
• On the Expected Relative Performance of List Scheduling
• Probabilistic Bounds on the Performance of List Scheduling
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• A Note on Heuristics of Flow-Shop Scheduling

This page was built for publication: