scientific article; zbMATH DE number 1462947

DOI10.1002/(SICI)1520-6750(200004)47:3%3C259::AID-NAV5%3E3.0.CO;2-KzbMATH Open0956.90009MaRDI QIDQ4487091FDOQ4487091

Authors: George J. Kyparisis, C. Koulamas 

Publication date: 21 June 2000

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

Recommendations

• Approximation algorithms for two-stage flexible flow shop scheduling
• Two-stage proportionate flexible flow shop to minimize the makespan
• Two kinds of three-stage flexible flow shop problem with batch processing machine
• A note on scheduling flowshops with flexible stage ordering

zbMATH Keywords

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (11)

• Performance guarantees for flowshop heuristics to minimize makespan
• A taxonomy of flexible flow line scheduling procedures
• The hybrid flow shop scheduling problem
• Scheduling of a single crane in batch annealing process
• A note on scheduling flowshops with flexible stage ordering
• The three-stage assembly flowshop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
• Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines
• Flexible flow shop scheduling with uniform parallel machines
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective

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 Q4487091)