Improved integer linear programming formulations for the job sequencing and tool switching problem
From MaRDI portal
(Redirected from Publication:319452)
Recommendations
- Improved heuristic algorithms for the job sequencing and tool switching problem
- Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
- An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines
- A linear programming-based method for job shop scheduling
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
- scientific article; zbMATH DE number 1418275
- An improved shifting bottleneck procedure for the job shop scheduling problem
- An algorithmic framework for tool switching problems with multiple objectives
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
Cites work
- k-server problems with bulk requests: an application to tool switching in manufacturing
- A strongly competitive randomized paging algorithm
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Multiperiod tool and production assignment in flexible manufacturing systems
- Opportunistic retooling of a flexible machine subject to failure
- Scheduling with resource management in manufacturing systems
- Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
- The tool switching problem revisited
- Tool magazine arrangement and operations sequencing on CNC machines
Cited in
(17)- Improved heuristic algorithms for the job sequencing and tool switching problem
- An algorithmic framework for tool switching problems with multiple objectives
- Scheduling identical parallel machines with tooling constraints
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem
- A matheuristic for parallel machine scheduling with tool replacements
- An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines
- A new consensus ranking approach for correlated ordinal information based on Mahalanobis distance
- Analysis of models for the stochastic outpatient procedure scheduling problem
- Data-driven distributionally robust surgery planning in flexible operating rooms over a Wasserstein ambiguity
- Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
- Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research
- Unsupervised parallel machines scheduling with tool switches
- Exploiting symmetry for the job sequencing and tool switching problem
- A dynamic programming approach for the job sequencing and tool switching problem
- On serial and parallel evaluation functions for job sequencing and tool switching problems
- On location-routing formulations for the Hamiltonian p-median problem
This page was built for publication: Improved integer linear programming formulations 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 Q319452)
