Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
From MaRDI portal
Publication:707768
DOI10.1007/s10589-008-9206-5zbMath1202.90143OpenAlexW1976673615MaRDI QIDQ707768
Oleg V. Shylo, Panos M. Pardalos, Alkis A. Vazacopoulos
Publication date: 8 October 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9206-5
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Preemptive scheduling in a two-stage supply chain to minimize the makespan, A tabu search/path relinking algorithm to solve the job shop scheduling problem, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times, Coordination of production and transportation in supply chain scheduling, A new hybrid parallel genetic algorithm for the job‐shop scheduling problem, Combining prospect theory with fuzzy theory to handle disruption in production scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Problem difficulty for tabu search in job-shop scheduling
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- The job shop scheduling problem: Conventional and new solution techniques
- Benchmarks for shop scheduling problems
- Deterministic job-shop scheduling: Past, present and future
- Benchmarks for basic scheduling problems
- An advanced tabu search algorithm for the job shop problem
- Some aspects of scatter search in the flow-shop problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- A Fast Taboo Search Algorithm for the Job Shop Problem
