An improved shifting bottleneck procedure for the job shop scheduling problem

DOI10.1016/S0305-0548(03)00243-0MaRDI QIDQ1879795zbMATH OpenOpenAlexFDO

Authors Wenqi Huang, Aihua Yin

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)

Recommendations

• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A modified shifting bottleneck procedure for job-shop scheduling
• A note on the shifting bottleneck procedure for job shop scheduling
• A computational study of shifting bottleneck procedures for shop scheduling problems
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
• A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• scientific article; zbMATH DE number 1271322

Cites work

• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• scientific article; zbMATH DE number 3757695 (Why is no real title available?)
• A Computational Study of the Job-Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• An Algorithm for Solving the Job-Shop Problem
• Applying tabu search to the job-shop scheduling problem
• Benchmarks for basic scheduling problems
• Evolution based learning in a job shop scheduling environment
• Guided local search with shifting bottleneck for job shop scheduling
• Job Shop Scheduling by Simulated Annealing
• Job-Shop Scheduling by Implicit Enumeration
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The one-machine sequencing problem

Cited in

(10)

• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A modified shifting bottleneck procedure for job-shop scheduling
• Improving job-shop schedules through critical pairwise exchanges
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Multi-neighborhood based path relinking for two-sided assembly line balancing problem
• A New Bottleneck-Based Heuristic for Reentrant Job Shops: A Case Study in a Textile Factory
• A computational study of shifting bottleneck procedures for shop scheduling problems
• Improved integer linear programming formulations for the job sequencing and tool switching problem
• Mathematical model for cyclic scheduling with work-in-process minimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879795)