A modified shifting bottleneck procedure for job-shop scheduling

DOI10.1080/00207549308956766zbMath0773.90036OpenAlexW2072610440MaRDI QIDQ4696979

Stéphane Dauzère-Pérès, Jean-Bernard Lasserre

Publication date: 29 June 1993

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

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

zbMATH Keywords

job-shop schedulingshifting bottleneck procedure

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (31)

Integration of lotsizing and scheduling decisions in a job-shop ⋮ A multi-criteria approach for scheduling semiconductor wafer fabrication facilities ⋮ Evolution based learning in a job shop scheduling environment ⋮ Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem ⋮ A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags ⋮ An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints ⋮ On the representation of the one machine sequencing problem in the shifting bottleneck heuristic ⋮ A procedure for the one-machine sequencing problem with dependent jobs ⋮ A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem ⋮ A note on the shifting bottleneck procedure for job shop scheduling ⋮ Study on constraint scheduling algorithm for job shop problems with multiple constraint machines ⋮ Ant colony optimization combined with taboo search for the job shop scheduling problem ⋮ Unnamed Item ⋮ Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches ⋮ A heuristic for scheduling general job shops to minimize maximum lateness ⋮ Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. ⋮ Modelling and rescheduling of a re-entrant wafer fabrication line involving machine unreliability ⋮ Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration ⋮ A modified shifting bottleneck procedure for job-shop scheduling ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Extending the shifting bottleneck procedure to real-life applications ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Measures of subproblem criticality in decomposition algorithms for shop scheduling ⋮ An integrated tabu search algorithm for the lot streaming problem in job shops ⋮ Single machine scheduling subject to precedence delays ⋮ Decomposition methods for reentrant flow shops with sequence-dependent setup times ⋮ Benchmarks for shop scheduling problems ⋮ Applying machine based decomposition in 2-machine flow shops ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures ⋮ Decomposition methods for large job shops ⋮ A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops

Cites Work

• The one-machine sequencing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Job-Shop Scheduling by Implicit Enumeration
• A modified shifting bottleneck procedure for job-shop scheduling

This page was built for publication: A modified shifting bottleneck procedure for job-shop scheduling