scientific article; zbMATH DE number 870411
From MaRDI portal
Publication:4875843
Recommendations
- Optimal dynamic routing in flexible manufacturing systems with limited buffers
- Exact solution procedures for certain planning problems in flexible manufacturing systems
- Computationally improved optimal control methodology for linear programming problems of flexible manufacturing systems
- scientific article; zbMATH DE number 4130175
- Path-clearing policies for flexible manufacturing systems
- An efficient method to determine the optimal configuration of a flexible manufacturing system
- The optimal design of flexible manufacturing systems
- scientific article; zbMATH DE number 975812
- Hamiltonian path planning in constrained workspace
- Multi-objective routing and scheduling in flexible manufacturing systems under uncertainty
Cited in
(45)- Fault-free longest paths in star networks with conditional link faults
- Hamiltonian connectivity of the WK-recursive network with faulty nodes
- Order picking in an automatic warehouse: Solving online asymmetric TSPs
- A tabu search algorithm for scheduling a single robot in a job-shop environment
- An improved ant colony system for the sequential ordering problem
- Coupling ant colony systems with strong local searches
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- Improving the filtering of branch-and-bound MDD solver
- \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Beam-ACO for the travelling salesman problem with time windows
- Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant
- On mathematical programming with indicator constraints
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Solving the single crane scheduling problem at rail transshipment yards
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults
- A time bucket formulation for the traveling salesman problem with time windows
- Metaheuristics for the asymmetric Hamiltonian path problem
- Load-dependent and precedence-based models for pickup and delivery problems
- Paint batching problem on M-to-1 conveyor systems
- Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
- The delivery man problem with time windows
- Vertex-pancyclicity of twisted cubes with maximal faulty edges
- Bounding, filtering and diversification in CP-based local branching
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
- A hybrid particle swarm optimization approach for the sequential ordering problem
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
- Domain-independent dynamic programming
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Longest fault-free paths in hypercubes with vertex faults
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- A heuristic manipulation technique for the sequential ordering problem
- Solving the Hamiltonian path problem with a light-based computer
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes
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 Q4875843)
