A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems

Cites Work

Unnamed Item
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
A general approach for optimizing regular criteria in the job-shop scheduling problem
Maintaining longest paths incrementally
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Depth-first iterative-deepening: An optimal admissible tree search
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
Job-shop scheduling with processing alternatives.
Solving the flexible job shop scheduling problem with sequence-dependent setup times
A batch-oblivious approach for complex job-shop scheduling problems
Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
Effective neighbourhood functions for the flexible job shop problem
Multiobjective optimization for complex flexible job-shop scheduling problems
Applying tabu search to the job-shop scheduling problem
Surgical case scheduling as a generalized job shop scheduling problem
An advanced tabu search algorithm for the job shop problem
Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
Accelerating the calculation of makespan used in scheduling improvement heuristics
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
A research survey: review of flexible job shop scheduling techniques
Job Shop Scheduling by Simulated Annealing
Flowshop and Jobshop Schedules: Complexity and Approximation
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
The Schedule-Sequencing Problem
A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management
Scheduling

This page was built for publication: A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems