A heuristic search algorithm for flow-shop scheduling

MaRDI QIDQ3605739zbMATH OpenFDO

Authors Joshua Poh-Onn Fan, Graham Winley

Publication date 24 February 2009

zbMATH Keywords

flow-shop problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A new heuristic for the n-job, M-machine flow-shop problem
• An efficient heuristic approach to the scheduling of jobs in a flowshop
• A genetic algorithm for flow shop scheduling problems
• A heuristic genetic algorithm for flowshop scheduling
• Heuristic algorithms for continuous flow-shop problem

Cited in

(10)

• An efficient heuristic approach to the scheduling of jobs in a flowshop
• Sevast'yanov's algorithm for the flow-shop scheduling problem
• Optimal and heuristic solutions for a scheduling problem arising in a foundry
• Heuristics for scheduling in a flow shop with multiple processors
• A survey and evaluation of static flowshop scheduling heuristics
• Depth-first heuristic search for the job shop scheduling problem
• AI*IA 2005: Advances in Artificial Intelligence
• A fast method for heuristics in large-scale flow shop scheduling
• Some efficient heuristic methods for the flow shop sequencing problem
• Heuristic algorithms for two machine re-entrant flow shop

This page was built for publication: A heuristic search algorithm for flow-shop scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605739)