New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
From MaRDI portal
Publication:4022914
DOI10.1287/mnsc.38.10.1495zbMath0759.90048OpenAlexW2145079270MaRDI QIDQ4022914
Renzo Vaccari, S. David Wu, Robert H. Storer
Publication date: 17 January 1993
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.38.10.1495
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A multi-objective memetic algorithm for the job-shop scheduling problem ⋮ The no-wait job shop with regular objective: a method based on optimal job insertion ⋮ Scheduling flexible flow lines with sequence-dependent setup times ⋮ An improved shifting bottleneck procedure for the job shop scheduling problem ⋮ Ant colony optimisation with parameterised search space for the job shop scheduling problem ⋮ An adaptive scheduling algorithm for a parallel machine problem with rework processes ⋮ Unrelated parallel machine scheduling using local search ⋮ Genetically improved presequences for Euclidean traveling salesman problems ⋮ Evolution based learning in a job shop scheduling environment ⋮ Job-shop local-search move evaluation without direct consideration of the criterion's value ⋮ A backward approach in list scheduling algorithms for multi-machine tardiness problems ⋮ Auction-based approach for a flexible job-shop scheduling problem with multiple process plans ⋮ Multi-objectivization via decomposition: an analysis of helper-objectives and complete decomposition ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ A hybrid evolutionary algorithm to solve the job shop scheduling problem ⋮ A very fast TS/SA algorithm for the job shop scheduling problem ⋮ On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ A new set of high-performing heuristics to minimise flowtime in permutation flowshops ⋮ A tabu search/path relinking algorithm to solve the job shop scheduling problem ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Optimal job insertion in the no-wait job shop ⋮ A generalized permutation approach to job shop scheduling with genetic algorithms ⋮ Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling ⋮ Scheduling with tool changes to minimize total completion time under controllable machining conditions ⋮ A fluid approach to large volume job shop scheduling ⋮ Problem space local search for number partitioning ⋮ Metaheuristics: A bibliography ⋮ A new dispatching rule based genetic algorithm for the multi-objective job shop problem ⋮ Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach ⋮ A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness ⋮ Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation ⋮ Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint ⋮ A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources ⋮ Resource-constrained project scheduling: A critical activity reordering heuristic ⋮ Firefly-Inspired Algorithm for Job Shop Scheduling ⋮ Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem ⋮ Algorithms for single machine total tardiness scheduling with sequence dependent setups ⋮ Approximative procedures for no-wait job shop scheduling. ⋮ CONFLICT IDENTIFICATION AND RECONCILIATION IN A COLLABORATIVE MANUFACTURING SCHEDULING TASK ⋮ Unnamed Item ⋮ An experimental analysis of local minima to improve neighbourhood search. ⋮ An efficient genetic algorithm for job shop scheduling with tardiness objectives. ⋮ Efficient algorithms for machine scheduling problems with earliness and tardiness penalties ⋮ A review of the joint replenishment problem literature: 1989--2005 ⋮ An advanced tabu search algorithm for the job shop problem ⋮ A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem ⋮ Case-based reasoning and improved adaptive search for project scheduling ⋮ No-wait job shop scheduling: tabu search and complexity of subproblems ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm ⋮ One-machine rescheduling heuristics with efficiency and stability as criteria ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ On single-walk parallelization of the job shop problem solving algorithms ⋮ Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ A new neighborhood and tabu search for the blocking job shop ⋮ A game-theoretic control approach for job shops in the presence of disruptions ⋮ A genetic algorithm approach to curve fitting ⋮ Models and algorithms for the dynamic-demand joint replenishment problem ⋮ Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation ⋮ An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ A genetic algorithm methodology for complex scheduling problems ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates. ⋮ Fast parallel heuristics for the job shop scheduling problem ⋮ Due date and cost-based FMS loading, scheduling and tool management ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Two simulated annealing-based heuristics for the job shop scheduling problem ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ A lower bound for the job insertion problem. ⋮ Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ IMPERFECT COORDINATION IN OPTIMIZATION ⋮ A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES ⋮ Measures of subproblem criticality in decomposition algorithms for shop scheduling ⋮ A new hybrid parallel genetic algorithm for the job‐shop scheduling problem ⋮ Complete local search with limited memory algorithm for no-wait job shops to minimize makespan ⋮ Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process ⋮ PSPLIB -- a project scheduling problem library ⋮ A heuristic hybrid framework for vector job scheduling ⋮ A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem ⋮ An extended enterprise planning methodology for the discrete manufacturing industry ⋮ Efficiency of reductions of job-shop to flow-shop problems ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Benchmarks for shop scheduling problems ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion ⋮ Perturbation heuristics for the pickup and delivery traveling salesman problem ⋮ Problem difficulty for tabu search in job-shop scheduling
Uses Software
This page was built for publication: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
