The Shifting Bottleneck Procedure for Job Shop Scheduling
From MaRDI portal
Publication:3778528
DOI10.1287/mnsc.34.3.391zbMath0637.90051OpenAlexW2088304441MaRDI QIDQ3778528
Joseph Brian Adams, Daniel J. Zawack, Egon Balas
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.3.391
Related Items (only showing first 100 items - show all)
A branch and bound algorithm for the job-shop scheduling problem ⋮ Preemptive scheduling with release dates, delivery times and sequence independent setup times ⋮ Integration of lotsizing and scheduling decisions in a job-shop ⋮ A decomposition approach for a resource constrained scheduling problem ⋮ The job-shop problem and immediate selection ⋮ An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ A robust approach for the single machine scheduling problem ⋮ A multi-criteria approach for scheduling semiconductor wafer fabrication facilities ⋮ Job shop scheduling with setup times, deadlines and precedence constraints ⋮ Adjustment of heads and tails for the job-shop problem ⋮ A decision support system for the resource constrained project scheduling problem ⋮ A decomposition approach in a DSS for a resource constrained scheduling problem ⋮ A genetic algorithm for the job shop problem ⋮ Evolution based learning in a job shop scheduling environment ⋮ Effective job shop scheduling through active chain manipulation ⋮ Dynamic resource allocation: a flexible and tractable modeling framework ⋮ Permutation-induced acyclic networks 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 ⋮ Optimal length resolution refutations of difference constraint systems ⋮ Principles for the design of large neighborhood search ⋮ Multi-objectivization via decomposition: an analysis of helper-objectives and complete decomposition ⋮ A hybrid evolutionary algorithm to solve the job shop scheduling problem ⋮ A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling ⋮ Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops ⋮ A tabu search/path relinking algorithm to solve the job shop scheduling problem ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ An optimization-based heuristic for the machine reassignment problem ⋮ An effective lower bound on \(L_{\max}\) in a worker-constrained job shop ⋮ Solving the job-shop scheduling problem optimally by dynamic programming ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective ⋮ Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics ⋮ An effective new island model genetic algorithm for job shop scheduling problem ⋮ Heuristic approaches for scheduling jobs in large-scale flexible job shops ⋮ A bi-objective approach for scheduling ground-handling vehicles in airports ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors ⋮ A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags ⋮ A fluid approach to large volume job shop scheduling ⋮ On the representation of the one machine sequencing problem in the shifting bottleneck heuristic ⋮ New single machine and job-shop scheduling problems with availability constraints ⋮ Minimizing total weighted tardiness in a generalized job shop ⋮ Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication ⋮ Tabu-search for the multi-mode job-shop problem ⋮ A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem ⋮ Scheduling algorithms for a semiconductor probing facility ⋮ A procedure for the one-machine sequencing problem with dependent jobs ⋮ Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem ⋮ Job-shop scheduling: Computational study of local search and large-step optimization methods ⋮ On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms ⋮ A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem ⋮ An alternative framework to Lagrangian relaxation approach for job shop scheduling. ⋮ Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. ⋮ Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis ⋮ An agent-based parallel approach for the job shop scheduling problem with genetic algorithms ⋮ Augmented neural networks for task scheduling. ⋮ Job-shop scheduling with processing alternatives. ⋮ An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective ⋮ A time-indexed LP-based approach for min-sum job-shop problems ⋮ Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm ⋮ An experimental analysis of local minima to improve neighbourhood search. ⋮ An efficient genetic algorithm for job shop scheduling with tardiness objectives. ⋮ Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem ⋮ A branch and bound method for the job-shop problem with sequence-dependent setup times ⋮ Scheduling coordination problems in supply chain planning ⋮ Ant colony optimization combined with taboo search for the job shop scheduling problem ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ A time indexed formulation of non-preemptive single machine scheduling problems ⋮ An algorithm for the maximum revenue jobshop problem ⋮ A filter-and-fan approach to the job shop scheduling problem ⋮ One-machine rescheduling heuristics with efficiency and stability as criteria ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ A new neighborhood and tabu search for the blocking job shop ⋮ A heuristic for scheduling general job shops to minimize maximum lateness ⋮ Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming ⋮ Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration ⋮ Jackson's semi-preemptive scheduling on a single machine ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ Hybrid rollout approaches for the job shop scheduling problem ⋮ Scheduling trains as a blocking parallel-machine job shop scheduling problem ⋮ Extending the shifting bottleneck procedure to real-life applications ⋮ A neural network model for scheduling problems ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ The generalized shifting bottleneck procedure ⋮ An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances ⋮ The life span method -- a new variant of local search ⋮ Sevast'yanov's algorithm for the flow-shop scheduling problem ⋮ Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks ⋮ An integrated tabu search algorithm for the lot streaming problem in job shops ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Benchmarks for shop scheduling problems ⋮ Cellular control of manufacturing systems ⋮ The job shop tardiness problem: A decomposition approach ⋮ An approximation algorithm for a single-machine scheduling problem with release times and delivery times ⋮ Tabu search for the job-shop scheduling problem with multi-purpose machines ⋮ Study of a NP-hard cyclic scheduling problem: The recurrent job-shop ⋮ Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm ⋮ Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
This page was built for publication: The Shifting Bottleneck Procedure for Job Shop Scheduling
