scientific article; zbMATH DE number 1054933

MaRDI QIDQ4350045zbMATH OpenFDO

Authors Peter Brucker, Johann L. Hurink

Publication date 28 August 1997

zbMATH Keywords

assemblingbatchingflexible manufacturinglocal searchsequencingsimulated annealingtabu search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Improving local search heuristics for some scheduling problems. II
• Local Search in Complex Scheduling Problems
• Some efficient heuristic methods for the flow shop sequencing problem
• scientific article; zbMATH DE number 4091174

Cited in

(8)

• Applications of modern heuristic search methods to pattern sequencing problems
• Metaheuristics: A bibliography
• Morph-based local-search heuristics for large-scale combinatorial data analysis
• Sequencing via explanation-based learning
• An architecture for solving sequencing and resource allocation problems using approximation methods
• Search heuristics for operation sequencing in process planning
• NP-completeness of some optimal sequencing problems with a given grouping of elements
• scientific article; zbMATH DE number 764457 (Why is no real title available?)

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