A Computational Study of the Job-Shop Scheduling Problem
From MaRDI portal
(Redirected from 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)- Computing lower and upper bounds for a large-scale industrial 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
- A permutation-based approach for solving the job-shop problem
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Job-shop scheduling with processing alternatives.
- Approximative procedures for no-wait job shop scheduling.
- Heuristic methods for gang-rip saw arbor design.
- 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
- Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems
- JOBSHOP
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem
- A competent memetic algorithm for complex scheduling
- Large neighbourhood search algorithms for the founder sequence reconstruction problem
- 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
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- 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
- A neighborhood for complex job shop scheduling problems with regular objectives
- An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
- A linear programming-based method for job shop scheduling
- 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
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
- 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
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
- Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
- A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems
- Immersed NURBS for CFD applications
- Dynamic resource allocation: a flexible and tractable modeling framework
- Scheduling manufacturing systems with blocking: a Petri net approach
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
- scientific article; zbMATH DE number 5969127 (Why is no real title available?)
- A study of integer programming formulations for scheduling problems
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- Solving the job-shop scheduling problem optimally by dynamic programming
- Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
- An effective new island model genetic algorithm for job shop scheduling problem
- Mixed integer programming models for job shop scheduling: A computational analysis
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- Depth-first heuristic search for the job shop scheduling problem
- Incorporating the strength of MIP modeling in schedule construction
- scientific article; zbMATH DE number 4010198 (Why is no real title available?)
- scientific article; zbMATH DE number 4099024 (Why is no real title available?)
- An Algorithm for Solving the Job-Shop Problem
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- Project scheduling with flexible resources: formulation and inequalities
- Measures of subproblem criticality in decomposition algorithms for shop scheduling
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- 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
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)
