Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 432815 (Why is no real title available?)
- A hybrid genetic algorithm for the job shop scheduling problem
- Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
- scientific article; zbMATH DE number 1701758 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 780782 (Why is no real title available?)
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Short Shop Schedules
- ACLIPS: A capacity and lead time integrated procedure for scheduling
- Staffing a software project: A constraint satisfaction and optimization-based approach
- 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
- Permutation-induced acyclic networks for the job shop scheduling problem
- Incorporating the strength of MIP modeling in schedule construction
- A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Optimization software class libraries
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- A neighborhood for complex job shop scheduling problems with regular objectives
- Local search with constraint propagation and conflict-based heuristics
- Effective job shop scheduling through active chain manipulation
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- Rescheduling job shops under random disruptions
- Optimal infinite scheduling for multi-priced timed automata
- Hybrid rollout approaches for the job shop scheduling problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- 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
- 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
- scientific article; zbMATH DE number 7453120 (Why is no real title available?)
- Arc-B-consistency of the inter-distance constraint
- Approximation algorithms for multiprocessor scheduling under uncertainty
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- LSSPER
- GALib
- OR-Library
- TSPTW
- Choco
- BL data set
- Beam-ACO
- MPSPLib
- RanGen
- POPMUSIC
- ILOG SCHEDULE
- B3muRGA
- Mistral
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- CP Optimizer
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- Local Search and Constraint Programming
- 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
- Local search genetic algorithms for the job shop scheduling problem
- Job Shop Scheduling by Local Search
- Benchmarks for shop scheduling problems
- A branch and bound algorithm for the job-shop scheduling problem
- How to make OR-results available: A proposal for project scheduling
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems
- 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
- 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 using neural networks
- Mixed integer programming models for job shop scheduling: A computational analysis
- The job shop scheduling problem: Conventional and new solution techniques
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
- 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
- Extending the shifting bottleneck procedure to real-life applications
- A new hybrid parallel genetic algorithm for the 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
- Depth-first heuristic search for the job shop scheduling problem
- A competent memetic algorithm for complex scheduling
- Deterministic job-shop scheduling: Past, present and future
- scientific article; zbMATH DE number 1054937 (Why is no real title available?)
- A filter-and-fan approach to the job shop scheduling problem
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Benchmarks for basic scheduling problems
- Applying constraint satisfaction techniques to job shop scheduling
- Approximative procedures for no-wait job shop scheduling.
- An ant colony optimization algorithm for shop scheduling problems
- A heuristic for scheduling general job shops to minimize maximum lateness
This page was built for software: JOBSHOP
