Improving job-shop schedules through critical pairwise exchanges

DOI10.1080/002075498193633zbMATH Open0951.90505OpenAlexW2105529942WikidataQ57186024 ScholiaQ57186024MaRDI QIDQ4245535FDOQ4245535

Authors: Chengbin Chu, Chengen Wang, Jean Marie Proth 

Publication date: 2 January 2001

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075498193633

Recommendations

• An improved shifting bottleneck procedure for the job shop scheduling problem
• Generalized pairwise interchanges and machine scheduling
• Better approximation guarantees for job-shop scheduling
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Improved Approximation Algorithms for Shop Scheduling Problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A bi-directional scheduling approach for job shops
• Optimal job scheduling for flowshops
• A modified shifting bottleneck procedure for job-shop scheduling

Mathematics Subject Classification ID

Production models (90B30)

Cited In (4)

• Reliability centered multi objective hybrid flow shop scheduling
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• Subset-restricted interchange for dynamic min-max scheduling problems
• Accelerating the calculation of makespan used in scheduling improvement heuristics

This page was built for publication: Improving job-shop schedules through critical pairwise exchanges

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