A tabu search experience in production scheduling
From MaRDI portal
Publication:2366998
DOI10.1007/BF02023072zbMath0775.90205MaRDI QIDQ2366998
Manuel Laguna, J. Wesley Barnes
Publication date: 16 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (12)
A tabu-search heuristic for the flexible-resource flow shop scheduling problem ⋮ Part type selection problem in flexible manufacturing systems: Tabu search algorithms ⋮ Using tabu search to solve the common due date early/tardy machine scheduling problem ⋮ On a scheduling problem in a robotized analytical system ⋮ An improved tabu search approach for solving the job shop scheduling problem with tooling constraints ⋮ Metaheuristics: A bibliography ⋮ A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling ⋮ Continuous flow models for batch manufacturing: a basis for a hierarchical approach ⋮ A genetic algorithm methodology for complex scheduling problems ⋮ A tabu search algorithm for the multi-trip vehicle routing and scheduling problem ⋮ A tabu search approach to machine scheduling ⋮ Tabu search in audit scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Structural analysis of local search heuristics in combinatorial optimization
- A new heuristic method for the flow shop sequencing problem
- Tabu search techniques. A tutorial and an application to neural networks
- A probabilistic heuristic for a computationally difficult set covering problem
- Optimizing tabu list size for the traveling salesman problem
- 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
- Hashing vectors for tabu search
- Sequencing with Earliness and Tardiness Penalties: A Review
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Job Shop Scheduling by Simulated Annealing
- Branch-and-Bound Strategies for Dynamic Programming
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
This page was built for publication: A tabu search experience in production scheduling