Algorithmical approaches to business process design
From MaRDI portal
Recommendations
Cites work
- A genetic algorithm approach to single and multiobjective structural optimization with discrete–continuous variables
- A genetic algorithm for flowshop sequencing
- A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines.
- A genetic algorithm for the job shop problem
- A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
- Algorithm for tool placement in an automatic tool change magazine
- Future paths for integer programming and links to artificial intelligence
- Genetic algorithms and tabu search: Hybrids for optimization
- Genetic learning of dynamic scheduling within a simulation environment
- scientific article; zbMATH DE number 51430 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Resource-constrained project scheduling: A survey of recent developments.
- Scheduling in a sequence dependent setup environment with genetic search
- Some new results on simulated annealing applied to the job shop scheduling problem
- Tabu search for resource-constrained scheduling
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Using tabu search to schedule activities of stochastic resource-constrained projects
Cited in
(5)- Experiences with applying a genetic algorithm to determine an information systems architecture
- A tribute to Rudolf vetschera
- Evolutionary optimization of business process designs
- Note—A Branch-and-Fathom Algorithm for the Long Range Process Design Problem
- Design technique for organizational-process flowsheet in clothing manufacture
This page was built for publication: Algorithmical approaches to business process design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955965)