Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
From MaRDI portal
Publication:2783788
DOI10.1287/mnsc.44.2.262zbMath0989.90057OpenAlexW2120855292MaRDI QIDQ2783788
Egon Balas, Alkis A. Vazacopoulos
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.44.2.262
Related Items
An improved shifting bottleneck procedure for the job shop scheduling problem, A multi-criteria approach for scheduling semiconductor wafer fabrication facilities, Job shop scheduling with setup times, deadlines and precedence constraints, Problems of discrete optimization: challenges and main approaches to solve them, Dynamic resource allocation: a flexible and tractable modeling framework, Job-shop local-search move evaluation without direct consideration of the criterion's value, Scheduling of a job-shop problem with limited output buffers, A hybrid evolutionary algorithm to solve the job shop scheduling problem, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, A very fast TS/SA algorithm for the job shop scheduling problem, A tabu search/path relinking algorithm to solve the job shop scheduling problem, Scatter search with path relinking for the job shop with time lags and setup times, Nondeterministic control for hybrid search, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, 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, Heuristic approaches for scheduling jobs in large-scale flexible job shops, An algorithm for the job shop scheduling problem based on global equilibrium search techniques, On the representation of the one machine sequencing problem in the shifting bottleneck heuristic, Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems, Application of quantum approximate optimization algorithm to job shop scheduling problem, A general approach for optimizing regular criteria in the job-shop scheduling problem, A repairing technique for the local search of the job-shop problem., A variable depth search branching, An experimental analysis of local minima to improve neighbourhood search., A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Effective neighbourhood functions for the flexible job shop problem, Ant colony optimization combined with taboo search for the job shop scheduling problem, An advanced tabu search algorithm for the job shop problem, Efficient primal heuristic updates for the blocking job shop problem, Local search algorithms for finding the Hamiltonian completion number of line graphs, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, No-wait job shop scheduling: tabu search and complexity of subproblems, Extended GRASP for the job shop scheduling problem with total weighted tardiness objective, The job shop scheduling problem with convex costs, A filter-and-fan approach to the job shop scheduling problem, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, A competent memetic algorithm for complex scheduling, Production Control of a Flexible Manufacturing System in a Job Shop Environment, An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, Solving job shop scheduling problems utilizing the properties of backbone and ``big valley, A probabilistic cooperative-competitive hierarchical model for global optimization, Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach, Iterated local search for the quadratic assignment problem, Supercomputer Scheduling with Combined Evolutionary Techniques, Deterministic job-shop scheduling: Past, present and future, A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands, Measures of subproblem criticality in decomposition algorithms for shop scheduling, Heuristics for minimizing total weighted tardiness in flexible flow shops, An tentative taboo search algorithm for job shop scheduling, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, Decomposition methods for reentrant flow shops with sequence-dependent setup times, Applying machine based decomposition in 2-machine flow shops, A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes, Problem difficulty for tabu search in job-shop scheduling, A tabu search approach to machine scheduling, Looking ahead with the pilot method, Control abstractions for local search
Uses Software
