A tabu search approach to machine scheduling

DOI10.1016/S0377-2217(97)00275-0zbMath0991.90054OpenAlexW1980625685MaRDI QIDQ1609892

Vicente Valls, Maria Angelés Pérez, M. Sacramento Quintanilla

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00275-0

zbMATH Keywords

schedulingtabu searchtabu thresholding

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items

Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres, An efficient genetic algorithm for job shop scheduling with tardiness objectives., Solving a novel inventory location model with stochastic constraints and \((R,s,S)\) inventory control policy, A survey of scheduling problems with setup times or costs, Scheduling in a continuous galvanizing line, Parameter tuning for local-search-based matheuristic methods, Multiple machine JIT scheduling: a tabu search approach, Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic

Cites Work

• A branch and bound algorithm for the job-shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• A decision support system for the resource constrained project scheduling problem
• A tabu search experience in production scheduling
• A tabu-search heuristic for the flexible-resource flow shop scheduling problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• Sequencing with Earliness and Tardiness Penalties: A Review
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• Tabu Search—Part II
• Job Shop Scheduling with Due Dates and Variable Processing Times
• Alternative Formulation of the Job Shop Problem with Due Dates
• A Survey of Scheduling Rules
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Job-Shop Scheduling by Implicit Enumeration
• The Complexity of Flowshop and Jobshop Scheduling
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm