A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
From MaRDI portal
Publication:2471233
DOI10.1016/j.cor.2006.12.019zbMath1177.90155MaRDI QIDQ2471233
Stéphane Dauzère-Pérès, Yazid Mati, Imen Essafi
Publication date: 22 February 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.12.019
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Algorithms for a realistic variant of flowshop scheduling, Order acceptance using genetic algorithms, Computing minimal doubly resolving sets of graphs, Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
Cites Work
- Unnamed Item
- A genetic algorithm for the job shop problem
- Evolution based learning in a job shop scheduling environment
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- A hybrid genetic algorithm for the open shop scheduling problem
- A large step random walk for minimizing total weighted tardiness in a job shop
- Decomposition methods for large job shops
- Deterministic job-shop scheduling: Past, present and future
- A hybrid genetic algorithm for the job shop scheduling problem
- Job Shop Scheduling by Simulated Annealing
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Algorithms for Solving Production-Scheduling Problems
