scientific article; zbMATH DE number 1783887

zbMATH Open1042.90565MaRDI QIDQ4546263FDOQ4546263

Authors: Victor Portugal, J. L. Scott 

Publication date: 19 August 2002

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

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

Mathematics Subject Classification ID

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

Cited In (5)

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

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)