A Computational Study of the Job-Shop Scheduling Problem

DOI10.1287/IJOC.3.2.149zbMATH Open0755.90039DBLPjournals/informs/ApplegateC91OpenAlexW2071306171WikidataQ56698006 ScholiaQ56698006MaRDI QIDQ4025904FDOQ4025904

Authors: David 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

Recommendations

• A new approach to computing optimal schedules for the job-shop scheduling problem
• A branch and bound algorithm for the job-shop scheduling problem
• An Algorithm for Solving the Job-Shop Problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A survey of methods for the solution of problems of scheduling theory

zbMATH Keywords

lower boundsbranch and boundheuristic procedurejob-shop schedulingcutting-plane method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (only showing first 100 items - show all)

• A study of integer programming formulations for scheduling problems
• Constraint propagation techniques for the disjunctive scheduling problem
• Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
• An Algorithm for Solving the Job-Shop Problem
• Staffing a software project: A constraint satisfaction and optimization-based approach
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Modelling and heuristics of FMS scheduling with multiple objectives
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
• Local search with constraint propagation and conflict-based heuristics
• Project scheduling with flexible resources: formulation and inequalities
• Optimal infinite scheduling for multi-priced timed automata
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• Hybrid rollout approaches for the job shop scheduling problem
• Event-based MILP models for resource-constrained project scheduling problems
• Dynamic resource allocation: a flexible and tractable modeling framework
• Title not available (Why is that?)
• Ant colony optimization combined with taboo search 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
• A tabu search/path relinking algorithm to solve the job shop scheduling problem
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
• Measures of subproblem criticality in decomposition algorithms for shop scheduling
• Approximation algorithms for multiprocessor scheduling under uncertainty
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Scheduling and constraint propagation
• Benchmarks for shop scheduling problems
• JOBSHOP
• A branch and bound algorithm for the job-shop scheduling problem
• Job-shop scheduling with processing alternatives.
• Title not available (Why is that?)
• Solving the job-shop scheduling problem optimally by dynamic programming
• Combining VNS with constraint programming for solving anytime optimization problems
• Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
• An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
• Instance space analysis and algorithm selection for the job shop scheduling problem
• Decomposition methods for large job shops
• The job shop scheduling problem: Conventional and new solution techniques
• An effective new island model genetic algorithm for job shop scheduling problem
• Mixed integer programming models for job shop scheduling: A computational analysis
• A novel threshold accepting meta-heuristic for the job-shop scheduling problem
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
• Applying tabu search to the job-shop scheduling problem
• Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms
• Principles for the design of large neighborhood search
• A linear programming-based method for job shop scheduling
• A new hybrid parallel genetic algorithm for the job-shop scheduling problem
• An algorithm for the job shop scheduling problem based on global equilibrium search techniques
• An improved shifting bottleneck procedure for the job shop scheduling problem
• Extending the shifting bottleneck procedure to real-life applications
• Title not available (Why is that?)
• Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• An integrated tabu search algorithm for the lot streaming problem in job shops
• A genetic algorithm for the job shop problem
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• A competent memetic algorithm for complex scheduling
• Depth-first heuristic search for the job shop scheduling problem
• Job shop scheduling with beam search
• Deterministic job-shop scheduling: Past, present and future
• Minimizing total weighted tardiness in a generalized job shop
• Approximation algorithms for shop scheduling problems with minsum objective
• A filter-and-fan approach to the job shop scheduling problem
• Title not available (Why is that?)
• A generalized permutation approach to job shop scheduling with genetic algorithms
• Benchmarks for basic scheduling problems
• A new neighborhood and tabu search for the blocking job shop
• Solving the open shop scheduling problem
• Approximative procedures for no-wait job shop scheduling.
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
• A heuristic for scheduling general job shops to minimize maximum lateness
• Evolution based learning in a job shop scheduling environment
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Two simulated annealing-based heuristics for the job shop scheduling problem
• A lower bound for the job insertion problem.
• Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• A hybrid genetic algorithm for the job shop scheduling problem
• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
• Job-shop scheduling with blocking and no-wait constraints
• Combining metaheuristics with mathematical programming, constraint programming and machine learning
• A very fast TS/SA algorithm for the job shop scheduling problem
• An advanced tabu search algorithm for the job shop problem
• Title not available (Why is that?)
• A study on the enhanced best performance algorithm for the just-in-time scheduling problem
• Improving branch and bound for jobshop scheduling with constraint propagation
• Incorporating the strength of MIP modeling in schedule construction
• Permutation-induced acyclic networks for the job shop scheduling problem
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• The generalized shifting bottleneck procedure
• A neighborhood for complex job shop scheduling problems with regular objectives
• Immersed NURBS for CFD applications
• Effective job shop scheduling through active chain manipulation
• Heuristic methods for gang-rip saw arbor design.
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
• The job-shop problem and immediate selection
• Combining metaheuristics with mathematical programming, constraint programming and machine learning
• Firefly-Inspired Algorithm for Job Shop Scheduling

This page was built for publication: A Computational Study of the Job-Shop Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025904)