Depth-first heuristic search for the job shop scheduling problem
From MaRDI portal
Publication:363574
DOI10.1007/S10479-012-1296-XzbMATH Open1271.90035OpenAlexW2009343968MaRDI QIDQ363574FDOQ363574
Authors: 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
Recommendations
- Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules
- A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- A heuristic search algorithm for flow-shop scheduling
- A Novel Heuristic Approach for Job Shop Scheduling Problem
- Fast parallel heuristics for the job shop scheduling problem
- scientific article; zbMATH DE number 773975
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A search space analysis of the job shop scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- A Computational Study of the Job-Shop Scheduling Problem
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Scheduling
- Applying tabu search to the job-shop scheduling problem
- Job Shop Scheduling by Simulated Annealing
- Algorithms for Solving Production-Scheduling Problems
- The one-machine sequencing problem
- A branch and bound algorithm for the job-shop scheduling problem
- Benchmarks for basic scheduling problems
- An Algorithm for Solving the Job-Shop Problem
- The job shop scheduling problem: Conventional and new solution techniques
- Job shop scheduling with setup times, deadlines and precedence constraints
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- Solving an integrated job-shop problem with human resource constraints
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Depth-first iterative-deepening: An optimal admissible tree search
- Solution-guided multi-point constructive search for job shop scheduling
- 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
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Nested partitions for the large-scale extended job shop scheduling problem
- Extending the single machine-based relaxation scheme for the job shop scheduling problem
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
- A job-shop problem with one additional resource type
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Fuzzy job shop scheduling with lot-sizing
Cited In (7)
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- AI*IA 2005: Advances in Artificial Intelligence
- Title not available (Why is that?)
- A memetic algorithm for restoring feasibility in scheduling with limited makespan
- Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- A depth-first search algorithm based on special properties of PFSP
Uses Software
This page was built for publication: Depth-first heuristic search for the job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q363574)
