A general approach for optimizing regular criteria in the job-shop scheduling problem
From MaRDI portal
Publication:418093
DOI10.1016/J.EJOR.2011.01.046zbMATH Open1237.90093OpenAlexW2018085234MaRDI QIDQ418093FDOQ418093
Stèphane Dauzère-Pérès, Chams Lahlou, Yazid Mati
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Survey of Scheduling Rules
- Job Shop Scheduling by Simulated Annealing
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Benchmarks for basic scheduling problems
- Guided local search with shifting bottleneck for job shop scheduling
- 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
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Job shop scheduling with beam search
- Deterministic job-shop scheduling: Past, present and future
- Effective neighbourhood functions for the flexible job shop problem
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- 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
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
Cited In (25)
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
- A neighborhood for complex job shop scheduling problems with regular objectives
- Solving a real-life multi-skill resource-constrained multi-project scheduling problem
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- Importance of verifying queue model assumptions before planning with simulation software
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
- A batch-oblivious approach for complex job-shop scheduling problems
- The no-wait job shop with regular objective: a method based on optimal job insertion
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
- Job-shop local-search move evaluation without direct consideration of the criterion's value
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
- Energy cost efficient scheduling in flexible job-shop manufacturing systems
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- Multiobjective optimization for complex flexible job-shop scheduling problems
- The job shop scheduling problem with convex costs
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
- 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
This page was built for publication: A general approach for optimizing regular criteria in the job-shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418093)
