Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3605739
Jump to:navigation, search

zbMATH Open1172.90398MaRDI QIDQ3605739

Graham Winley, Joshua Poh-Onn Fan

Publication date: 24 February 2009



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


zbMATH Keywords

flow-shop problems


Mathematics Subject Classification ID

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



Related Items (8)

Depth-first heuristic search for the job shop scheduling problem ⋮ Some efficient heuristic methods for the flow shop sequencing problem ⋮ Heuristic algorithms for two machine re-entrant flow shop ⋮ An efficient heuristic approach to the scheduling of jobs in a flowshop ⋮ Optimal and heuristic solutions for a scheduling problem arising in a foundry ⋮ Heuristics for scheduling in a flow shop with multiple processors ⋮ A fast method for heuristics in large-scale flow shop scheduling ⋮ Sevast'yanov's algorithm for the flow-shop scheduling problem






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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3605739&oldid=17027559"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 05:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki