Deterministic job-shop scheduling: Past, present and future
From MaRDI portal
(Redirected from Publication:1807948)
Recommendations
Cites work
- scientific article; zbMATH DE number 3147701 (Why is no real title available?)
- scientific article; zbMATH DE number 3873052 (Why is no real title available?)
- scientific article; zbMATH DE number 4135692 (Why is no real title available?)
- scientific article; zbMATH DE number 4099024 (Why is no real title available?)
- scientific article; zbMATH DE number 3757695 (Why is no real title available?)
- scientific article; zbMATH DE number 18531 (Why is no real title available?)
- scientific article; zbMATH DE number 23663 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 49601 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3573593 (Why is no real title available?)
- scientific article; zbMATH DE number 3633982 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 558542 (Why is no real title available?)
- scientific article; zbMATH DE number 702559 (Why is no real title available?)
- scientific article; zbMATH DE number 710069 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1054936 (Why is no real title available?)
- scientific article; zbMATH DE number 1054937 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 3436925 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 194622 (Why is no real title available?)
- scientific article; zbMATH DE number 4115948 (Why is no real title available?)
- scientific article; zbMATH DE number 764422 (Why is no real title available?)
- scientific article; zbMATH DE number 805284 (Why is no real title available?)
- scientific article; zbMATH DE number 846900 (Why is no real title available?)
- scientific article; zbMATH DE number 894722 (Why is no real title available?)
- scientific article; zbMATH DE number 925015 (Why is no real title available?)
- scientific article; zbMATH DE number 3431960 (Why is no real title available?)
- scientific article; zbMATH DE number 3388814 (Why is no real title available?)
- scientific article; zbMATH DE number 3392252 (Why is no real title available?)
- A Branch-Bound Solution to the General Scheduling Problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- A Direct Search Method to Locate Negative Cycles in a Graph
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A Generalized Machine-Scheduling Algorithm
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem
- A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
- A Method of Solution for General Machine-Scheduling Problems
- A Non-Numerical Approach to Production Scheduling Problems
- A Survey of Scheduling Rules
- A block approach for single-machine scheduling with release dates and due dates
- A branch and bound algorithm for the job-shop scheduling problem
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling
- A computational study of shifting bottleneck procedures for shop scheduling problems
- A dual algorithm for the one-machine scheduling problem
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A genetic algorithm applied to a classic job-shop scheduling problem
- A genetic algorithm for the job shop problem
- A modified shifting bottleneck procedure for job-shop scheduling
- A neural network model for scheduling problems
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A procedure for the one-machine sequencing problem with dependent jobs
- A search space analysis of the job shop scheduling problem
- A survey of priority rule-based scheduling
- Adaptive scheduling algorithm based on mixed graph model
- Adjustment of heads and tails for the job-shop problem
- Algorithms for Solving Production-Scheduling Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Algorithm for Solving the Job-Shop Problem
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
- An efficient algorithm for the job-shop problem with two jobs
- An expert neural network system for dynamic job shop scheduling
- Applying constraint satisfaction techniques to job shop scheduling
- Applying tabu search to the job-shop scheduling problem
- Benchmarks for basic scheduling problems
- Benchmarks for shop scheduling problems
- Computational Complexity of Discrete Optimization Problems
- Constraint Propagation Based Scheduling of Job Shops
- Constraint-based job shop scheduling with Ilog Scheduler
- Disjunctive Programming
- Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach
- Effective job shop scheduling through active chain manipulation
- Evolution based learning in a job shop scheduling environment
- Extending the shifting bottleneck procedure to real-life applications
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Focused simulated annealing search: An application to job shop scheduling
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Future paths for integer programming and links to artificial intelligence
- Guided local search with shifting bottleneck for job shop scheduling
- How easy is local search?
- Improved Approximation Algorithms for Shop Scheduling Problems
- Improving local search heuristics for some scheduling problems. I
- Improving local search heuristics for some scheduling problems. II
- Insertion techniques for the heuristic solution of the job shop problem
- Job Shop Scheduling by Local Search
- Job Shop Scheduling by Simulated Annealing
- Job shop scheduling with beam search
- Job shop scheduling with deadlines
- Job-Shop Scheduling by Implicit Enumeration
- Job-shop scheduling using neural networks
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Large-step Markov chains for the TSP incorporating local search heuristics
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Mathematical programming formulations for machine scheduling: A survey
- NP-hardness of shop-scheduling problems with three jobs
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Obtaining test problems via Internet
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
- On the complexity of two machine job-shop scheduling with regular objective functions
- On the facial structure of scheduling polyhedra
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by ghost image processes in neural networks
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Parallel branch-and-bound methods for the job-shop scheduling problem
- Preemptive job-shop scheduling problems with a fixed number of jobs
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- Scaling properties of neural networks for job-shop scheduling
- Scheduling of project networks
- Scheduling the General Job-Shop
- Short Shop Schedules
- Simulated annealing: An introduction
- Simulation studies in JIT production
- Solution of the Akers-Friedman Scheduling Problem
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- Some new results on simulated annealing applied to the job shop scheduling problem
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Constraints
- Surrogate duality relaxation for job shop scheduling
- Tabu Search—Part I
- Tabu Search—Part II
- Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The complexity of shop-scheduling problems with two or three jobs
- The generalized shifting bottleneck procedure
- The job shop scheduling problem: Conventional and new solution techniques
- The one-machine sequencing problem
- The schedule-sequencing problem
- Total completion time minimization in two-machine job shops with unit-time operations
Cited in
(98)- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
- An advanced tabu search algorithm for the job shop problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Optimization of logistic systems using fuzzy weighted aggregation
- A constraint programming method for advanced planning and scheduling system with multilevel structured products
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem
- Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net
- A hybrid metaheuristic algorithm to optimise a real-world robotic cell
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm
- Scheduling with timed automata
- Permutation-induced acyclic networks for the job shop scheduling problem
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
- Problem difficulty for tabu search in job-shop scheduling
- Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots
- Two-machine job-shop scheduling with one joint job
- Job-shop scheduling with mixed blocking constraints between operations
- Tabu search algorithms for job-shop problems with a single transport robot
- A Taxonomy for the Flexible Job Shop Scheduling Problem
- A review of TSP based approaches for flowshop scheduling
- Monte Carlo tree search for priced timed automata
- An effective hybrid optimization strategy for job-shop scheduling problems
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
- Job shop scheduling optimization through multiple independent particle swarms
- Hybrid rollout approaches for the job shop scheduling problem
- Scheduling the truckload operations in automatic warehouses
- Hierarchical minimization of completion time variance and makespan in jobshops
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- Risk measure of job shop scheduling with random machine breakdowns
- Extending the single machine-based relaxation scheme for the job shop scheduling problem
- Multiple colony ant algorithm for job-shop scheduling problem
- A deep multi-agent reinforcement learning approach to solve dynamic job shop scheduling problem
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
- A repairing technique for the local search of the job-shop problem.
- On not-first/not-last conditions in disjunctive scheduling
- An experimental analysis of local minima to improve neighbourhood search.
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A machine-order search space for job-shop scheduling problems
- Propagation and branching strategies for job shop scheduling minimizing the weighted energy consumption
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
- Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- Deterministic job-shop scheduling problems with capacity focus
- A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
- Models for equipment selection and upgrade in manufacturing systems of machine building enterprises
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- Aggregation in job scheduling in machine works
- Job-shop local-search move evaluation without direct consideration of the criterion's value
- No-wait job shop scheduling: tabu search and complexity of subproblems
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- A priority-based genetic algorithm for a flexible job shop scheduling problem
- An effective architecture for learning and evolving flexible job-shop schedules
- Solving the job-shop scheduling problem optimally by dynamic programming
- A time-indexed LP-based approach for min-sum job-shop problems
- Optimizing makespan and stability risks in job shop scheduling
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Multicriteria optimisation and simulation: an industrial application
- Resource-constrained multi-project scheduling problem: a survey
- Adaptive temperature control for simulated annealing: a comparative study
- Multi-agent based beam search for intelligent production planning and scheduling
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
- An effective new island model genetic algorithm for job shop scheduling problem
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem
- Current trends in deterministic scheduling
- Solving job shop problems in the context of hypergraphs
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Multiobjective optimization for complex flexible job-shop scheduling problems
- Machine scheduling in production: a content analysis
- Optimal scheduling for flexible job shop operation
- Job shop scheduling with beam search
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
- A new neighborhood and tabu search for the blocking job shop
- Multi-resource allocation in stochastic project scheduling
- The job shop scheduling problem with convex costs
- Approximative procedures for no-wait job shop scheduling.
- Surgical case scheduling as a generalized job shop scheduling problem
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
- On one approach to constructing timetables of freight trains in a railroad network
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule
- A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling
- A hybrid genetic algorithm for the job shop scheduling problem
- Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
- A very fast TS/SA algorithm for the job shop scheduling problem
This page was built for publication: Deterministic job-shop scheduling: Past, present and future
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807948)
