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
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, A multi-objective memetic algorithm for the job-shop scheduling problem, An improved shifting bottleneck procedure for the job shop scheduling problem, A new lower bound for the job-shop scheduling problem, Multi-agent based beam search for intelligent production planning and scheduling, A tabu search experience in production scheduling, Routing and scheduling in a flexible job shop by tabu search, Applying tabu search to the job-shop scheduling problem, A novel threshold accepting meta-heuristic for the job-shop scheduling problem, Adaptive temperature control for simulated annealing: a comparative study, Executing production schedules in the face of uncertainties: a review and some future directions, Reducing simulation models for scheduling manufacturing facilities, Job-shop local-search move evaluation without direct consideration of the criterion's value, Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time, A very fast TS/SA algorithm for the job shop scheduling problem, A simulated multi-objective model for flexible job shop transportation scheduling, Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search, An exact approach for the 0-1 knapsack problem with setups, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, Optimal job insertion in the no-wait job shop, Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports, Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, A sequencing problem with family setup times, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem, A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times, Semiconductor final-test scheduling under setup operator constraints, Instance space analysis and algorithm selection for the job shop scheduling problem, An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning, Enhancing CLP branch and bound techniques for scheduling problems, Sensitivity analysis for bottleneck assignment problems, A batch-oblivious approach for complex job-shop scheduling problems, A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem, Integrated production and material handling scheduling using mathematical programming and constraint programming, A linear programming-based method for job shop scheduling, Study on constraint scheduling algorithm for job shop problems with multiple constraint machines, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, An advanced tabu search algorithm for the job shop problem, Unnamed Item, Efficient primal heuristic updates for the blocking job shop problem, Four decades of research on the open-shop scheduling problem to minimize the makespan, A new approach to computing optimal schedules for the job-shop scheduling problem, A prediction based iterative decomposition algorithm for scheduling large-scale job shops, Extended GRASP for the job shop scheduling problem with total weighted tardiness objective, The job shop scheduling problem with convex costs, Rule-based scheduling in wafer fabrication with due date-based objectives, A competent memetic algorithm for complex scheduling, A hybrid genetic algorithm for the job shop scheduling problem, A dynamic job shop scheduling framework: a backward approach, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, A game-theoretic control approach for job shops in the presence of disruptions, Managing a two-bottleneck job shop with a two-machine flow shop algorithm, Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches, A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling, Continuous flow models for batch manufacturing: a basis for a hierarchical approach, Exploring relaxation induced neighborhoods to improve MIP solutions, Project scheduling under uncertainty: survey and research potentials, Maximization of solution flexibility for robust shop scheduling, A theoretic and practical framework for scheduling in a stochastic environment, Hierarchical minimization of completion time variance and makespan in jobshops, Nested partitions for the large-scale extended job shop scheduling problem, Optimal timing of a sequence of tasks with general completion costs, A genetic algorithm methodology for complex scheduling problems, Alternative graph formulation for solving complex factory-scheduling problems, Real time production improvement through bottleneck control, Permutation flow shop scheduling with earliness and tardiness penalties, A scatter search approach to sequence-dependent setup times job shop scheduling, The application of genetic algorithms to lot streaming in a job-shop scheduling problem, Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems, Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study, Insertion techniques for the heuristic solution of the job shop problem, Two simulated annealing-based heuristics for the job shop scheduling problem, Job shop scheduling with beam search, Deterministic job-shop scheduling: Past, present and future, A lower bound for the job insertion problem., Measures of subproblem criticality in decomposition algorithms for shop scheduling, Heuristics for minimizing total weighted tardiness in flexible flow shops, Scheduling of wafer test processes in semiconductor manufacturing, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, A survey of scheduling with parallel batch (p-batch) processing, A hybrid genetic algorithm for the open shop scheduling problem, Single machine scheduling subject to precedence delays, Decomposition methods for reentrant flow shops with sequence-dependent setup times, Modelling and heuristics of FMS scheduling with multiple objectives, An extended enterprise planning methodology for the discrete manufacturing industry, Efficiency of reductions of job-shop to flow-shop problems, Applying machine based decomposition in 2-machine flow shops, The nonpermutation flowshop scheduling problem: adjustment and bounding procedures, A scheduling problem in the baking industry, Job-shop scheduling with blocking and no-wait constraints, Decomposition methods for large job shops, Part-mix allocation in a hybrid manufacturing system with a flexible manufacturing cell and a conventional jobshop, Scheduling larger job shops: a decomposition approach, Formulation and solution of the drum-buffer-rope constraint scheduling problem ( DBRCSP), On mathematical programming with indicator constraints, Concurrent operations can be parallelized in scheduling multiprocessor job shop, A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops, Minimizing makespan on parallel machines subject to release dates and delivery times, A tabu search approach to machine scheduling, Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints, A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time, A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem, Program trace optimization with constructive heuristics for combinatorial problems, Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem, Application of quantum approximate optimization algorithm to job shop scheduling problem, A note on the shifting bottleneck procedure for job shop scheduling, Firefly-Inspired Algorithm for Job Shop Scheduling, Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem, Unnamed Item, An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, An effective hybrid optimization strategy for job-shop scheduling problems, Modelling and rescheduling of a re-entrant wafer fabrication line involving machine unreliability, Minimizing L max for large-scale, job-shop scheduling problems, Scheduling jobshops with some identical or similar jobs, Heuristics for minimizing total weighted tardiness in complex job shops, Local search heuristics for two-stage flow shop problems with secondary criterion, Determination of batch size at a bottleneck machine in manufacturing systems, Lot streaming in a multiple product permutation flow shop with intermingling, A modified shifting bottleneck procedure for job-shop scheduling, SUPPLY CHAIN MODELED AS A METABOLIC PATHWAY, A genetic algorithm-based approach to machine assignment problem, New Rollout Algorithms for Combinatorial Optimization Problems, A new hybrid parallel genetic algorithm for the job‐shop scheduling problem, An tentative taboo search algorithm for job shop scheduling, A Taxonomy for the Flexible Job Shop Scheduling Problem
