Applications of modern heuristic search methods to pattern sequencing problems

DOI10.1016/S0305-0548(98)80001-4MaRDI QIDQ1302706zbMATH OpenFDO

Authors Andreas Fink, Stefan Voß

Publication date 23 November 1999

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristic searchproduction planningtabu searchpattern sequencing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1054933
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Some efficient heuristic methods for the flow shop sequencing problem
• scientific article; zbMATH DE number 4039626
• Improved heuristics for sequencing cutting patterns

Cited in

(15)

• A Review for Submodular Optimization on Machine Scheduling Problems
• Optimal patchings for consecutive ones matrices
• Minimization of open orders: application of a re-distribution coordination policy
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• A biased random-key genetic algorithm for the minimization of open stacks problem
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• An enhanced branch-and-bound algorithm for the talent scheduling problem
• Mathematical models for the minimization of open stacks problem
• On the one-dimensional stock cutting problem in the paper tube industry
• Looking ahead with the pilot method
• Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• An integrated cutting stock and sequencing problem
• A method for solving the minimization of the maximum number of open stacks problem within a cutting process

This page was built for publication: Applications of modern heuristic search methods to pattern sequencing problems

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