Depth-first heuristic search for the job shop scheduling problem
From MaRDI portal
Publication:363574
DOI10.1007/s10479-012-1296-xzbMath1271.90035OpenAlexW2009343968MaRDI QIDQ363574
Carlos Mencía, María R. Sierra, Ramiro Varela
Publication date: 3 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1296-x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A memetic algorithm for restoring feasibility in scheduling with limited makespan ⋮ Research on permutation flow shop scheduling problems with general position-dependent learning effects
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A job-shop problem with one additional resource type
- Solving an integrated job-shop problem with human resource constraints
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- Job shop scheduling with setup times, deadlines and precedence constraints
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Fuzzy job shop scheduling with lot-sizing
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- Depth-first iterative-deepening: An optimal admissible tree search
- The one-machine sequencing problem
- The job shop scheduling problem: Conventional and new solution techniques
- A branch and bound algorithm for the job-shop scheduling problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Constraint propagation techniques for the disjunctive scheduling problem
- The disjunctive graph machine representation of the job shop scheduling problem
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Nested partitions for the large-scale extended job shop scheduling problem
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Benchmarks for basic scheduling problems
- Applying tabu search to the job-shop scheduling problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- Algorithms for Solving Production-Scheduling Problems
- Scheduling
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
