New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
From MaRDI portal
Publication:4022914
DOI10.1287/mnsc.38.10.1495zbMath0759.90048MaRDI QIDQ4022914
S. David Wu, Robert H. Storer, Renzo Vaccari
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
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Unnamed Item, A game-theoretic control approach for job shops in the presence of disruptions, A genetic algorithm approach to curve fitting, Measures of subproblem criticality in decomposition algorithms for shop scheduling, Models and algorithms for the dynamic-demand joint replenishment problem, Due date and cost-based FMS loading, scheduling and tool management, Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, A new dominance rule to minimize total weighted tardiness with unequal release dates., Fast parallel heuristics for the job shop scheduling problem, Problem difficulty for tabu search in job-shop scheduling, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Scheduling with tool changes to minimize total completion time under controllable machining conditions, 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, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, Efficient algorithms for machine scheduling problems with earliness and tardiness penalties, Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm, A new neighborhood and tabu search for the blocking job shop, Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, One-machine rescheduling heuristics with efficiency and stability as criteria, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, The job shop scheduling problem: Conventional and new solution techniques, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, PSPLIB -- a project scheduling problem library, A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem, Reduction of job-shop problems to flow-shop problems with precedence constraints, Benchmarks for shop scheduling problems, Unrelated parallel machine scheduling using local search, Genetically improved presequences for Euclidean traveling salesman problems, Evolution based learning in a job shop scheduling environment, Resource-constrained project scheduling: A critical activity reordering heuristic, Approximative procedures for no-wait job shop scheduling., An experimental analysis of local minima to improve neighbourhood search., An efficient genetic algorithm for job shop scheduling with tardiness objectives., Efficiency of reductions of job-shop to flow-shop problems, Perturbation heuristics for the pickup and delivery traveling salesman problem, Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation, 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., An extended enterprise planning methodology for the discrete manufacturing industry, Scheduling flexible flow lines with sequence-dependent setup times, An improved shifting bottleneck procedure for the job shop scheduling problem, A backward approach in list scheduling algorithms for multi-machine tardiness problems, A generalized permutation approach to job shop scheduling with genetic algorithms, Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling, Problem space local search for number partitioning, Metaheuristics: A bibliography, A very fast TS/SA algorithm for the job shop scheduling problem, Algorithms for single machine total tardiness scheduling with sequence dependent setups, 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, No-wait job shop scheduling: tabu search and complexity of subproblems, 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, CONFLICT IDENTIFICATION AND RECONCILIATION IN A COLLABORATIVE MANUFACTURING SCHEDULING TASK, IMPERFECT COORDINATION IN OPTIMIZATION, A PARTICLE SWARM OPTIMIZATION ALGORITHM ON JOB-SHOP SCHEDULING PROBLEMS WITH MULTI-PURPOSE MACHINES, Unnamed Item
Uses Software
