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

An improved repair-based constraint satisfaction method for flow shop scheduling

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

zbMATH Open1174.90450MaRDI QIDQ5320045FDOQ5320045


Authors: Chunxia Shangguan, Hong Zhou, Ruifeng Shi, Yang Wu Edit this on Wikidata


Publication date: 22 July 2009





Recommendations

  • Applying constraint satisfaction techniques to job shop scheduling
  • scientific article; zbMATH DE number 2166451
  • scientific article; zbMATH DE number 5175842
  • Methods and Applications of Artificial Intelligence
  • A computational study of constraint satisfaction for multiple capacitated job shop scheduling


zbMATH Keywords

constraint satisfactionflow shop schedulingtotal weighted tardinessrepair-based method


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)



Cited In (1)

  • A sorting based efficient heuristic for pooled repair shop designs





This page was built for publication: An improved repair-based constraint satisfaction method for flow shop scheduling

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5320045&oldid=20002451"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 22:46. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki