Exploiting symmetry for the job sequencing and tool switching problem
From MaRDI portal
Publication:6565440
Cites work
- A computational comparison of symmetry handling methods for mixed integer programs
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem
- A strongly competitive randomized paging algorithm
- An algorithmic framework for tool switching problems with multiple objectives
- An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines
- Heuristic procedures for the parallel machine problem with tool switches
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
- Improved heuristic algorithms for the job sequencing and tool switching problem
- Improved integer linear programming formulations for the job sequencing and tool switching problem
- Improving Discrete Model Representations via Symmetry Considerations
- Job scheduling and management of wearing tools with stochastic tool lifetimes
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Minimising tool switching and indexing times by ant colony optimisation in automatic machining centres
- Minimizing the number of switch instances on a flexible machine in polynomial time
- Minimizing total flow time on a single flexible machine
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
- Modified orbital branching for structured symmetry with an application to unit commitment
- On the geometry of symmetry breaking inequalities
- Optimal allocation of surgery blocks to operating rooms under uncertainty
- Orbital branching
- Order picking along a crane-supplied pick face: the SKU switching problem
- Parallel machine scheduling with tool loading
- Production planning in automated manufacturing
- Scheduling identical parallel machines with tooling constraints
- Solutions to a modified tool loading problem for a single FMM
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
- Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
- Storage management of items in two levels of availability
- The Loading Problem
- The Randomized Coloring Procedure with Symmetry-Breaking
- The general two-level storage management problem: a reconsideration of the KTNS-rule
- The scheduling problem of PCBs for multiple non-identical parallel machines
- The tool switching problem revisited
This page was built for publication: Exploiting symmetry for the job sequencing and tool switching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565440)