A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
From MaRDI portal
(Redirected from Publication:6096569)
Cites work
- A batch-oblivious approach for complex job-shop scheduling problems
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A noncompact formulation for job-shop scheduling problems in traffic management
- A research survey: review of flexible job shop scheduling techniques
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- An advanced tabu search algorithm for the job shop problem
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Applying tabu search to the job-shop scheduling problem
- Depth-first iterative-deepening: An optimal admissible tree search
- Effective neighbourhood functions for the flexible job shop problem
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Guided local search with shifting bottleneck for job shop scheduling
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Job Shop Scheduling by Simulated Annealing
- Job-shop scheduling with processing alternatives.
- Maintaining longest paths incrementally
- Metaheuristics. From design to implementation.
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- Multi-resource shop scheduling with resource flexibility
- Multiobjective optimization for complex flexible job-shop scheduling problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Scheduling. Theory, algorithms, and systems
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- Surgical case scheduling as a generalized job shop scheduling problem
- The job shop scheduling problem: Conventional and new solution techniques
- The schedule-sequencing problem
Cited in
(6)- Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem
- An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective
- 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
- Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approach
- Multi-objective evolutionary algorithm based flexible assembly job-shop rescheduling with component sharing for order insertion
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)
