An algorithm for the job shop scheduling problem based on global equilibrium search techniques

DOI10.1007/s10287-006-0023-yzbMath1136.90017OpenAlexW2023954902MaRDI QIDQ867431

Oleg V. Shylo, Panos M. Pardalos

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

zbMATH Keywords

metaheuristicsmakespan

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A priority-based genetic algorithm for a flexible job shop scheduling problem, A review of recent advances in global optimization, A tabu search/path relinking algorithm to solve the job shop scheduling problem, MILP-based approaches for medium-term planning of single-stage continuous multiproduct plants with parallel units, Optimizing makespan and stability risks in job shop scheduling, Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization, Kernel technology to solve discrete optimization problems, 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, Solving job shop scheduling problems utilizing the properties of backbone and ``big valley, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, 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
• 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)