Tabu search for a class of single-machine scheduling problems

DOI10.1016/S0305-0548(00)00036-8zbMath1008.90020OpenAlexW2124496116WikidataQ127840494 ScholiaQ127840494MaRDI QIDQ5945325

A. Andijani, Umar M. Al-Turki, Chawki A. Fedjki

Publication date: 11 March 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00036-8

zbMATH Keywords

schedulingtabu searchV-shaped schedulesvariance minimization

Mathematics Subject Classification ID

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

Related Items

Automatised selection of load paths to construct reduced-order models in computational damage micromechanics: from dissipation-driven random selection to Bayesian optimization, Completion time variance minimisation on two identical parallel processors, Job scheduling methods for reducing waiting time variance, A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times, A lower bound for weighted completion time variance, Time-flexible min completion time variance in a single machine by quadratic programming, Computational aspects of dispersive computational continua for elastic heterogeneous media, An almost exact solution to the min completion time variance in a single machine, A branch and price algorithm for single-machine completion time variance, An efficient local search for minimizing completion time variance in permutation flow shops, Multiple machine JIT scheduling: a tabu search approach, Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem, Second-order homogenization of periodic materials based on asymptotic approximation of the strain energy: formulation and validity limits, Completion time variance minimization in single machine and multi-machine systems, Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm, Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times, Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests

Uses Software

• Tabu search

Cites Work

• Tabu search for large scale timetabling problems
• Some efficient heuristic methods for the flow shop sequencing problem
• Scheduling problems with non-regular penalty functions - a review
• Tabu search and design optimization
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• A dominant subset of \(V\)-shaped sequences for a class of single machine sequencing problems
• On tabu search for the location of interacting hub facilities
• Tabu search for the multilevel generalized assignment problem
• Future paths for integer programming and links to artificial intelligence
• Sequencing with Earliness and Tardiness Penalties: A Review
• Tabu Search—Part I
• Tabu Search—Part II
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Minimizing the Flow-time Variance in Single-machine Systems