An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
From MaRDI portal
Publication:1917279
DOI10.1016/0166-218X(95)00040-XzbMath0846.90049OpenAlexW2024649039MaRDI QIDQ1917279
Publication date: 7 July 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(95)00040-x
flexible manufacturing systemstabu searchheuristictooling constraints\(m\)-machine, \(n\)-job shop scheduling
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Scheduling with resource management in manufacturing systems, Improved integer linear programming formulations for the job sequencing and tool switching problem, Improved heuristic algorithms for the job sequencing and tool switching problem, On a scheduling problem in a robotized analytical system, A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times, Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints, Guidelines for the use of meta-heuristics in combinatorial optimization., Scheduling identical parallel machines with tooling constraints, Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem, A simple and effective hybrid genetic search for the job sequencing and tool switching problem, Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs, Scheduling multi-colour print jobs with sequence-dependent setup times
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new heuristic method for the flow shop sequencing problem
- Tabu search techniques. A tutorial and an application to neural networks
- The tabu search metaheuristic: How we used it
- Future paths for integer programming and links to artificial intelligence
- A user's guide to tabu search
- A tabu search experience in production scheduling
- Applying tabu search to the job-shop scheduling problem
- A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem