An algorithm for the job shop scheduling problem based on global equilibrium search techniques
From MaRDI portal
Publication:867431
DOI10.1007/s10287-006-0023-yzbMath1136.90017MaRDI QIDQ867431
Panos M. Pardalos, Oleg V. Shylo
Publication date: 15 February 2007
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-006-0023-y
90C47: Minimax problems in mathematical programming
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Global equilibrium search applied to the unconstrained binary quadratic optimization problem, A review of recent advances in global optimization, Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Problem difficulty for tabu search in job-shop scheduling
- Benchmarks for shop scheduling problems
- Deterministic job-shop scheduling: Past, present and future
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Benchmarks for basic scheduling problems
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)