A Computational Study of the Job-Shop Scheduling Problem
From MaRDI portal
Publication:4025904
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
Cited in
(only showing first 100 items - show all)- Job-shop scheduling: Computational study of local search and large-step optimization methods
- scientific article; zbMATH DE number 773975 (Why is no real title available?)
- Depth-first heuristic search for the job shop scheduling problem
- A competent memetic algorithm for complex scheduling
- 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
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A new neighborhood and tabu search for the blocking job shop
- Benchmarks for basic scheduling problems
- scientific article; zbMATH DE number 1839624 (Why is no real title available?)
- Approximative procedures for no-wait job shop scheduling.
- scientific article; zbMATH DE number 5969127 (Why is no real title available?)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- Solving the open shop scheduling problem
- A heuristic for scheduling general job shops to minimize maximum lateness
- Evolution based learning in a job shop scheduling environment
- Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
- 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
- Proactive release procedures for just-in-time job shop environments, subject to machine failures
- An extended enterprise planning methodology for the discrete manufacturing industry
- A theoretic and practical framework for scheduling in a stochastic environment
- Minimum formwork stock problem on residential buildings construction sites
- 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
- A very fast TS/SA algorithm for the job shop scheduling problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- An advanced tabu search algorithm for the job shop problem
- Constraint propagation techniques for the disjunctive scheduling problem
- A study of integer programming formulations for scheduling problems
- scientific article; zbMATH DE number 4010198 (Why is no real title available?)
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
- Staffing a software project: A constraint satisfaction and optimization-based approach
- An Algorithm for Solving the Job-Shop Problem
- Modelling and heuristics of FMS scheduling with multiple objectives
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Improving branch and bound for jobshop scheduling with constraint propagation
- Permutation-induced acyclic networks for the job shop scheduling problem
- Incorporating the strength of MIP modeling in schedule construction
- The generalized shifting bottleneck procedure
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- A neighborhood for complex job shop scheduling problems with regular objectives
- Immersed NURBS for CFD applications
- Local search with constraint propagation and conflict-based heuristics
- Effective job shop scheduling through active chain manipulation
- Heuristic methods for gang-rip saw arbor design.
- Project scheduling with flexible resources: formulation and inequalities
- 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
- Optimal infinite scheduling for multi-priced timed automata
- Event-based MILP models for resource-constrained project scheduling problems
- Hybrid rollout approaches for the job shop scheduling problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Dynamic resource allocation: a flexible and tractable modeling framework
- Hierarchical minimization of completion time variance and makespan in jobshops
- Firefly-Inspired Algorithm for Job Shop Scheduling
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- Auction-based approach for a flexible job-shop scheduling problem with multiple process plans
- An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
- Large neighbourhood search algorithms for the founder sequence reconstruction problem
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- On not-first/not-last conditions in disjunctive scheduling
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- 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
- A machine-order search space for job-shop scheduling problems
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
- scientific article; zbMATH DE number 7453120 (Why is no real title available?)
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems
- Arc-B-consistency of the inter-distance constraint
- A neural network model for scheduling problems
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
- Scheduling manufacturing systems with blocking: a Petri net approach
- A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem
- Approximation algorithms for multiprocessor scheduling under uncertainty
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- JOBSHOP
- A proposal of web application for the study and resolution of the job shop problem with makespan minimization via mixed integer linear programming
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- Measures of subproblem criticality in decomposition algorithms for shop scheduling
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Cellular control of manufacturing systems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Scheduling and constraint propagation
- No-wait job shop scheduling: tabu search and complexity of subproblems
- Benchmarks for shop scheduling problems
- A branch and bound algorithm for the job-shop scheduling problem
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)
