Depth-first heuristic search for the job shop scheduling problem
From MaRDI portal
(Redirected from Publication:363574)
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
Cites work
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- A Computational Study of the Job-Shop Scheduling Problem
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- A branch and bound algorithm for the job-shop scheduling problem
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- A job-shop problem with one additional resource type
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- Algorithms for Solving Production-Scheduling Problems
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- An Algorithm for Solving the Job-Shop Problem
- An advanced tabu search algorithm for the job shop problem
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Applying tabu search to the job-shop scheduling problem
- Benchmarks for basic scheduling problems
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- Constraint propagation techniques for the disjunctive scheduling problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Depth-first iterative-deepening: An optimal admissible tree search
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Extending the single machine-based relaxation scheme for the job shop scheduling problem
- Fuzzy job shop scheduling with lot-sizing
- Job Shop Scheduling by Simulated Annealing
- 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
- Nested partitions for the large-scale extended job shop scheduling problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling
- Solution-guided multi-point constructive search for job shop scheduling
- Solving an integrated job-shop problem with human resource constraints
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
- The disjunctive graph machine representation of the job shop scheduling problem
- The job shop scheduling problem: Conventional and new solution techniques
- The one-machine sequencing problem
Cited in
(7)- A depth-first search algorithm based on special properties of PFSP
- A memetic algorithm for restoring feasibility in scheduling with limited makespan
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- AI*IA 2005: Advances in Artificial Intelligence
- scientific article; zbMATH DE number 1974088 (Why is no real title available?)
- Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
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)
