JOBSHOP

swMATH4807MaRDI QIDQ16969FDOQ16969

Author name not available (Why is that?)

Described by source

• A Computational Study of the Job-Shop Scheduling Problem

Cited In (92)

• A neighborhood for complex job shop scheduling problems with regular objectives
• Effective job shop scheduling through active chain manipulation
• 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
• Title not available (Why is that?)
• Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
• Cellular control of manufacturing systems
• Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems
• A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
• An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
• Title not available (Why is that?)
• 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
• Incorporating the strength of MIP modeling in schedule construction
• A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
• Permutation-induced acyclic networks for the job shop scheduling problem
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
• Optimization software class libraries
• Local search with constraint propagation and conflict-based heuristics
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Rescheduling job shops under random disruptions
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
• Optimal infinite scheduling for multi-priced timed automata
• Hybrid rollout approaches for the job shop scheduling problem
• A new hybrid parallel genetic algorithm for the job‐shop scheduling 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
• Arc-B-consistency of the inter-distance constraint
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
• Title not available (Why is that?)
• Local Search and Constraint Programming
• Approximation algorithms for multiprocessor scheduling under uncertainty
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Job Shop Scheduling by Local Search
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Scheduling and constraint propagation
• Local search genetic algorithms for the job shop scheduling problem
• Benchmarks for shop scheduling problems
• A branch and bound algorithm for the job-shop scheduling problem
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• How to make OR-results available: A proposal for project scheduling
• 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
• Job-shop scheduling using neural networks
• Instance space analysis and algorithm selection for the job shop scheduling problem
• The job shop scheduling problem: Conventional and new solution techniques
• 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
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• 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
• 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
• Title not available (Why is that?)
• Depth-first heuristic search for the job shop scheduling problem
• Deterministic job-shop scheduling: Past, present and future
• 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
• Evolution based learning in a job shop scheduling environment
• Guided local search with shifting bottleneck for job shop scheduling
• A computational study of shifting bottleneck procedures for shop scheduling problems
• Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
• A theoretic and practical framework for scheduling in a stochastic environment
• Title not available (Why is that?)
• A hybrid genetic algorithm for the job shop scheduling problem
• Minimum formwork stock problem on residential buildings construction sites
• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
• Title not available (Why is that?)
• 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

This page was built for software: JOBSHOP