scientific article; zbMATH DE number 1054933

zbMATH Open0877.90040MaRDI QIDQ4350045FDOQ4350045

Authors: Peter Brucker, Johann L. Hurink 

Publication date: 28 August 1997

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

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

zbMATH Keywords

simulated annealinglocal searchtabu searchbatchingsequencingflexible manufacturingassembling

Mathematics Subject Classification ID

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

Cited In (7)

• Search heuristics for operation sequencing in process planning
• Title not available (Why is that?)
• Sequencing via explanation-based learning
• NP-completeness of some optimal sequencing problems with a given grouping of elements
• An architecture for solving sequencing and resource allocation problems using approximation methods
• Morph-based local-search heuristics for large-scale combinatorial data analysis
• Metaheuristics: A bibliography

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)