Hybrid rollout approaches for the job shop scheduling problem
From MaRDI portal
Publication:1014017
DOI10.1007/s10957-008-9362-xzbMath1166.90008OpenAlexW2079071191WikidataQ58921584 ScholiaQ58921584MaRDI QIDQ1014017
Publication date: 24 April 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9362-x
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Minimum and worst-case performance ratios of rollout algorithms ⋮ A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs ⋮ Patient scheduling in hemodialysis service ⋮ A rollout algorithm for the resource constrained elementary shortest path problem ⋮ Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A rollout metaheuristic for job shop scheduling problems
- An ant colony optimization algorithm for shop scheduling problems
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A survey of priority rule-based scheduling
- The job shop scheduling problem: Conventional and new solution techniques
- A branch and bound algorithm for the job-shop scheduling problem
- A genetic algorithm for the job shop problem
- Evolution based learning in a job shop scheduling environment
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Job shop scheduling with beam search
- Deterministic job-shop scheduling: Past, present and future
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Rollout algorithms for combinatorial optimization
- A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- A Survey of Scheduling Rules
- Computational Complexity of Discrete Optimization Problems
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Short Shop Schedules
- New Rollout Algorithms for Combinatorial Optimization Problems
- Algorithms for Solving Production-Scheduling Problems
- Job Shop Scheduling by Local Search
- An effective hybrid optimization strategy for job-shop scheduling problems
This page was built for publication: Hybrid rollout approaches for the job shop scheduling problem
