A Computational Study of the Job-Shop Scheduling Problem
From MaRDI portal
Publication:4025904
DOI10.1287/ijoc.3.2.149zbMath0755.90039OpenAlexW2071306171WikidataQ56698006 ScholiaQ56698006MaRDI QIDQ4025904
David L. Applegate, William Cook
Publication date: 18 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.3.2.149
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Auction-based approach for a flexible job-shop scheduling problem with multiple process plans, A machine-order search space for job-shop scheduling problems, Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search, A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem, Firefly-Inspired Algorithm for Job Shop Scheduling, Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem, Unnamed Item, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Unnamed Item, A new approach to computing optimal schedules for the job-shop scheduling problem, Proactive release procedures for just-in-time job shop environments, subject to machine failures, Combining metaheuristics with mathematical programming, constraint programming and machine learning, 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, Solving the open shop scheduling problem, A polyhedral study of the asymmetric traveling salesman problem with time windows, Measures of subproblem criticality in decomposition algorithms for shop scheduling, A new hybrid parallel genetic algorithm for the job‐shop scheduling problem, Incorporating the strength of MIP modeling in schedule construction, A branch and bound algorithm for the job-shop scheduling problem, An improved shifting bottleneck procedure for the job shop scheduling problem, Benchmarks for basic scheduling problems, Applying tabu search to the job-shop scheduling problem, The job-shop problem and immediate selection, A novel threshold accepting meta-heuristic for the job-shop scheduling problem, Adaptive temperature control for simulated annealing: a comparative study, 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, Principles for the design of large neighborhood search, How to make OR-results available: A proposal for project scheduling, A very fast TS/SA algorithm for 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, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, A tabu search/path relinking algorithm to solve the job shop scheduling problem, Solving the job-shop scheduling problem optimally by dynamic programming, An effective new island model genetic algorithm for job shop scheduling problem, Mixed integer programming models for job shop scheduling: A computational analysis, A generalized permutation approach to job shop scheduling with genetic algorithms, An algorithm for the job shop scheduling problem based on global equilibrium search techniques, A neighborhood for complex job shop scheduling problems with regular objectives, Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems, Depth-first heuristic search for the job shop scheduling problem, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, Arc-B-consistency of the inter-distance constraint, Minimizing total weighted tardiness in a generalized job shop, An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem, A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems, A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach, Instance space analysis and algorithm selection for the job shop scheduling problem, Job-shop scheduling: Computational study of local search and large-step optimization methods, An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning, Approximation algorithms for multiprocessor scheduling under uncertainty, Immersed NURBS for CFD Applications, Approximative procedures for no-wait job shop scheduling., Project scheduling with flexible resources: formulation and inequalities, An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms, Combining VNS with constraint programming for solving anytime optimization problems, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, Ant colony optimization combined with taboo search for the job shop scheduling problem, An advanced tabu search algorithm for the job shop problem, No-wait job shop scheduling: tabu search and complexity of subproblems, Optimal infinite scheduling for multi-priced timed automata, A filter-and-fan approach to the job shop scheduling problem, Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times, Staffing a software project: A constraint satisfaction and optimization-based approach, A competent memetic algorithm for complex scheduling, Large neighbourhood search algorithms for the founder sequence reconstruction problem, A new neighborhood and tabu search for the blocking job shop, Scheduling and constraint propagation, A hybrid genetic algorithm for the job shop scheduling problem, A heuristic for scheduling general job shops to minimize maximum lateness, A unified framework for partial and hybrid search methods in constraint programming, Exploring relaxation induced neighborhoods to improve MIP solutions, Event-based MILP models for resource-constrained project scheduling problems, A theoretic and practical framework for scheduling in a stochastic environment, 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, On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems, Scheduling manufacturing systems with blocking: a Petri net approach, Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems, 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, Hybrid rollout approaches for the job shop scheduling problem, A lower bound for the job insertion 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, JOBSHOP, Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks, Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain, Minimum formwork stock problem on residential buildings construction sites, An integrated tabu search algorithm for the lot streaming problem in job shops, 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, Reduction of job-shop problems to flow-shop problems with precedence constraints, Benchmarks for shop scheduling problems, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, Constraint propagation techniques for the disjunctive scheduling problem, Strong bounds for resource constrained project scheduling: preprocessing and cutting planes, A study of integer programming formulations for scheduling problems, Job-shop scheduling with blocking and no-wait constraints, On not-first/not-last conditions in disjunctive scheduling, Decomposition methods for large job shops, Cellular control of manufacturing systems, Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure, Tabu search for the job-shop scheduling problem with multi-purpose machines, Local search with constraint propagation and conflict-based heuristics, Approximation algorithms for shop scheduling problems with minsum objective, Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
