scientific article; zbMATH DE number 1783887

MaRDI QIDQ4546263zbMATH OpenFDO

Authors Victor Portugal, J. L. Scott

Publication date 19 August 2002

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 444983
• New heuristics for flow shop problem to minimize makespan
• Performance guarantees for flowshop heuristics to minimize makespan
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• Heuristic algorithms for continuous flow-shop problem

Cited in

(5)

• An empirical analysis of the optimality rate of flow shop heuristics
• An improved NEH heuristic to minimize makespan in permutation flow shops
• The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
• Asymptotic convergence of scheduling policies with respect to slowdown
• Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times

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