A Computational Study of the Job-Shop Scheduling Problem
From MaRDI portal
Publication:4025904
DOI10.1287/ijoc.3.2.149zbMath0755.90039WikidataQ56698006 ScholiaQ56698006MaRDI QIDQ4025904
William Cook, David L. Applegate
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
90B35: Deterministic scheduling theory in operations research
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Unnamed Item, Measures of subproblem criticality in decomposition algorithms for shop scheduling, Proactive release procedures for just-in-time job shop environments, subject to machine failures, A machine-order search space for job-shop scheduling problems, Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, Solving the open shop scheduling problem, JOBSHOP, Scheduling and constraint propagation, Permutation-induced acyclic networks for the job shop scheduling problem, Principles for the design of large neighborhood search, 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, An algorithm for the job shop scheduling problem based on global equilibrium search techniques, Arc-B-consistency of the inter-distance constraint, Minimizing total weighted tardiness in a generalized job shop, Combining VNS with constraint programming for solving anytime optimization problems, Ant colony optimization combined with taboo search for the job shop scheduling problem, A filter-and-fan approach to the job shop scheduling problem, Hybrid rollout approaches for the job shop scheduling problem, Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, Minimum formwork stock problem on residential buildings construction sites, An integrated tabu search algorithm for the lot streaming problem in job shops, 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, Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks, Reduction of job-shop problems to flow-shop problems with precedence constraints, Benchmarks for shop scheduling problems, Cellular control of manufacturing systems, Tabu search for the job-shop scheduling problem with multi-purpose machines, A branch and bound algorithm for the job-shop scheduling problem, The job-shop problem and immediate selection, 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, Job-shop scheduling: Computational study of local search and large-step optimization methods, Approximative procedures for no-wait job shop scheduling., Decomposition methods for reentrant flow shops with sequence-dependent setup times, Constraint propagation techniques for the disjunctive scheduling problem, On not-first/not-last conditions in disjunctive scheduling, Decomposition methods for large job shops, Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure, Local search with constraint propagation and conflict-based heuristics, Approximation algorithms for shop scheduling problems with minsum objective, Exploring relaxation induced neighborhoods to improve MIP solutions, 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., An extended enterprise planning methodology for the discrete manufacturing industry, Job-shop scheduling with blocking and no-wait constraints, An improved shifting bottleneck procedure for 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, How to make OR-results available: A proposal for project scheduling, A generalized permutation approach to job shop scheduling with genetic algorithms, A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times, 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, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, A theoretic and practical framework for scheduling in a stochastic environment, Benchmarks for basic scheduling problems, Applying tabu search to the job-shop scheduling problem, A very fast TS/SA algorithm 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, Staffing a software project: A constraint satisfaction and optimization-based approach, A hybrid genetic algorithm for the job shop scheduling problem, A unified framework for partial and hybrid search methods in constraint programming, 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, Modelling and heuristics of FMS scheduling with multiple objectives, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, A study of integer programming formulations for scheduling problems, Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain, Incorporating the strength of MIP modeling in schedule construction, Unnamed Item
