An improved shifting bottleneck procedure for the job shop scheduling problem

DOI10.1016/S0305-0548(03)00243-0zbMath1100.90509OpenAlexW2117647466MaRDI QIDQ1879795

Aihua Yin, Wenqi Huang

Publication date: 23 September 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00243-0

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Multi-neighborhood based path relinking for two-sided assembly line balancing problem ⋮ Mathematical model for cyclic scheduling with work-in-process minimization ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures

Cites Work

• Unnamed Item
• Unnamed Item
• The one-machine sequencing problem
• Evolution based learning in a job shop scheduling environment
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Benchmarks for basic scheduling problems
• Applying tabu search to the job-shop scheduling problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Job Shop Scheduling by Simulated Annealing
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Job-Shop Scheduling by Implicit Enumeration
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem

This page was built for publication: An improved shifting bottleneck procedure for the job shop scheduling problem