A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
From MaRDI portal
Publication:6096569
DOI10.1016/J.EJOR.2023.05.018MaRDI QIDQ6096569FDOQ6096569
Authors: Karim Tamssaouet, Stèphane Dauzère-Pérès 
Publication date: 15 September 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Metaheuristics. From design to implementation.
- Applying tabu search to the job-shop scheduling problem
- Job Shop Scheduling by Simulated Annealing
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Surgical case scheduling as a generalized job shop scheduling problem
- Guided local search with shifting bottleneck for job shop scheduling
- The schedule-sequencing problem
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- The job shop scheduling problem: Conventional and new solution techniques
- Multi-resource shop scheduling with resource flexibility
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Effective neighbourhood functions for the flexible job shop problem
- An advanced tabu search algorithm for the job shop problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Depth-first iterative-deepening: An optimal admissible tree search
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- Maintaining longest paths incrementally
- Job-shop scheduling with processing alternatives.
- A batch-oblivious approach for complex job-shop scheduling problems
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- Scheduling. Theory, algorithms, and systems
- Multiobjective optimization for complex flexible job-shop scheduling problems
- A research survey: review of flexible job shop scheduling techniques
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- A noncompact formulation for job-shop scheduling problems in traffic management
- Accelerating the calculation of makespan used in scheduling improvement heuristics
Cited In (5)
- A neighborhood for complex job shop scheduling problems with regular objectives
- An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
- An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective
- Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approach
- Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem
This page was built for publication: A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6096569)
