A general approach for optimizing regular criteria in the job-shop scheduling problem
From MaRDI portal
Publication:418093
DOI10.1016/j.ejor.2011.01.046zbMath1237.90093OpenAlexW2018085234MaRDI QIDQ418093
C. Lahlou, Yazid Mati, Stéphane Dauzère-Pérès
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.01.046
Related Items (24)
The no-wait job shop with regular objective: a method based on optimal job insertion ⋮ Job-shop local-search move evaluation without direct consideration of the criterion's value ⋮ Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective ⋮ Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem ⋮ A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm ⋮ Energy cost efficient scheduling in flexible job-shop manufacturing systems ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ Importance of verifying queue model assumptions before planning with simulation software ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ The job shop scheduling problem with convex costs ⋮ An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria ⋮ Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem ⋮ Fair optimization and networks: a survey ⋮ On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- A large step random walk for minimizing total weighted tardiness in a job shop
- Decomposition methods for large job shops
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Job shop scheduling with beam search
- Deterministic job-shop scheduling: Past, present and future
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Effective neighbourhood functions for the flexible job shop problem
- Benchmarks for basic scheduling problems
- An advanced tabu search algorithm for the job shop problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
- Job Shop Scheduling by Simulated Annealing
- A Survey of Scheduling Rules
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This page was built for publication: A general approach for optimizing regular criteria in the job-shop scheduling problem
