Deterministic job-shop scheduling: Past, present and future
From MaRDI portal
Publication:1807948
DOI10.1016/S0377-2217(98)00113-1zbMath0938.90028OpenAlexW2076785727MaRDI QIDQ1807948
Sheik Meeran, Anant Singh Jain
Publication date: 24 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00113-1
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A priority-based genetic algorithm for a flexible job shop scheduling problem, Minimizing the weighted number of tardy jobs on multiple machines: a review, Multi-agent based beam search for intelligent production planning and scheduling, Scheduling with timed automata, A novel threshold accepting meta-heuristic for the job-shop scheduling problem, Adaptive temperature control for simulated annealing: a comparative study, Job-shop local-search move evaluation without direct consideration of the criterion's value, Permutation-induced acyclic networks for the job shop scheduling problem, A hybrid heuristic to solve the parallel machines job-shop scheduling problem, A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem, A very fast TS/SA algorithm for the job shop scheduling problem, A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling, 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, An effective architecture for learning and evolving flexible job-shop schedules, A hybrid metaheuristic algorithm to optimise a real-world robotic cell, Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, Solving the job-shop scheduling problem optimally by dynamic programming, An effective new island model genetic algorithm for job shop scheduling problem, Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements, Risk measure of job shop scheduling with random machine breakdowns, Scheduling the truckload operations in automatic warehouses, Solving job shop problems in the context of hypergraphs, An algorithm for the job shop scheduling problem based on global equilibrium search techniques, Optimizing makespan and stability risks in job shop scheduling, A survey of single machine scheduling to minimize weighted number of tardy jobs, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time, Multi-resource allocation in stochastic project scheduling, A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem, A deep multi-agent reinforcement learning approach to solve dynamic job shop scheduling problem, Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule, An artificial bee colony algorithm for the job shop scheduling problem with random processing times, A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm, Resource-constrained multi-project scheduling problem: a survey, Application of quantum approximate optimization algorithm to job shop scheduling problem, Job-Shop Scheduling with Mixed Blocking Constraints between Operations, A general approach for optimizing regular criteria in the job-shop scheduling problem, Two-machine job-shop scheduling with one joint job, Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots, Monte Carlo tree search for priced timed automata, Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem, An agent-based parallel approach for the job shop scheduling problem with genetic algorithms, The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure., Multiple colony ant algorithm for job-shop scheduling problem, Approximative procedures for no-wait job shop scheduling., A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems, A repairing technique for the local search of the job-shop problem., A time-indexed LP-based approach for min-sum job-shop problems, Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm, An experimental analysis of local minima to improve neighbourhood search., Optimization of logistic systems using fuzzy weighted aggregation, A branch and bound method for the job-shop problem with sequence-dependent setup times, Ant colony optimization combined with taboo search for the job shop scheduling problem, Surgical case scheduling as a generalized job shop scheduling problem, An advanced tabu search algorithm for the job shop problem, Multiobjective optimization for complex flexible job-shop scheduling problems, Multicriteria optimisation and simulation: an industrial application, 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, A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, No-wait job shop scheduling: tabu search and complexity of subproblems, The job shop scheduling problem with convex costs, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net, Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments, A new neighborhood and tabu search for the blocking job shop, A hybrid genetic algorithm for the job shop scheduling problem, An effective hybrid optimization strategy for job-shop scheduling problems, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, Aggregation in job scheduling in machine works, Tabu search algorithms for job-shop problems with a single transport robot, Unnamed Item, Solving job shop scheduling problems utilizing the properties of backbone and ``big valley, 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, Mathematical models for job-shop scheduling problems with routing and process plan flexibility, Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem, Machine scheduling in production: a content analysis, Job shop scheduling with beam search, Optimal scheduling for flexible job shop operation, Hybrid rollout approaches for the job shop scheduling problem, Models for equipment selection and upgrade in manufacturing systems of machine building enterprises, Job shop scheduling optimization through multiple independent particle swarms, Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, A constraint programming method for advanced planning and scheduling system with multilevel structured products, A review of TSP based approaches for flowshop scheduling, On not-first/not-last conditions in disjunctive scheduling, A Taxonomy for the Flexible Job Shop Scheduling Problem, Problem difficulty for tabu search in job-shop scheduling, A knowledge-based evolutionary strategy for scheduling problems with bottlenecks, Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
Uses Software
Cites Work
- Mathematical programming formulations for machine scheduling: A survey
- Scheduling of project networks
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A block approach for single-machine scheduling with release dates and due dates
- An efficient algorithm for the job-shop problem with two jobs
- How easy is local search?
- A survey of priority rule-based scheduling
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- A procedure for the one-machine sequencing problem with dependent jobs
- The one-machine sequencing problem
- Surrogate duality relaxation for job shop scheduling
- The complexity of shop-scheduling problems with two or three jobs
- Large-step Markov chains for the TSP incorporating local search heuristics
- Extending the shifting bottleneck procedure to real-life applications
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling
- A neural network model for scheduling problems
- The job shop scheduling problem: Conventional and new solution techniques
- The generalized shifting bottleneck procedure
- Parallel branch-and-bound methods for the job-shop scheduling problem
- Total completion time minimization in two-machine job shops with unit-time operations
- A search space analysis of the job shop scheduling problem
- Benchmarks for shop scheduling problems
- Preemptive job-shop scheduling problems with a fixed number of jobs
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
- A branch and bound algorithm for the job-shop scheduling problem
- Adjustment of heads and tails for the job-shop problem
- Optimization by ghost image processes in neural networks
- 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
- On the complexity of two machine job-shop scheduling with regular objective functions
- Applying constraint satisfaction techniques to job shop scheduling
- Job shop scheduling with deadlines
- Constraint-based job shop scheduling with Ilog Scheduler
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Insertion techniques for the heuristic solution of the job shop problem
- Some new results on simulated annealing applied to the job shop scheduling problem
- Job shop scheduling with beam search
- Future paths for integer programming and links to artificial intelligence
- NP-hardness of shop-scheduling problems with three jobs
- Scaling properties of neural networks for job-shop scheduling
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Improving local search heuristics for some scheduling problems. I
- Obtaining test problems via Internet
- Focused simulated annealing search: An application to job shop scheduling
- Benchmarks for basic scheduling problems
- Applying tabu search to the job-shop scheduling problem
- A computational study of shifting bottleneck procedures for shop scheduling problems
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Optimal two- and three-stage production schedules with setup times included
- A genetic algorithm applied to a classic job-shop scheduling problem
- Solution of the Akers-Friedman Scheduling Problem
- Simulation studies in JIT production
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- On the facial structure of scheduling polyhedra
- Scheduling the General Job-Shop
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Simulated annealing: An introduction
- An Algorithm for Solving the Job-Shop Problem
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Surrogate Constraint Duality in Mathematical Programming
- Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
- A dual algorithm for the one-machine scheduling problem
- A Survey of Scheduling Rules
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Job-Shop Scheduling by Implicit Enumeration
- The Complexity of Flowshop and Jobshop Scheduling
- Disjunctive Programming
- Computational Complexity of Discrete Optimization Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Job-shop scheduling using neural networks
- Improved Approximation Algorithms for Shop Scheduling Problems
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Short Shop Schedules
- Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach
- An expert neural network system for dynamic job shop scheduling
- A modified shifting bottleneck procedure for job-shop scheduling
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
- Adaptive scheduling algorithm based on mixed graph model
- The Schedule-Sequencing Problem
- Constraint Propagation Based Scheduling of Job Shops
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem
- A Non-Numerical Approach to Production Scheduling Problems
- A Branch-Bound Solution to the General Scheduling Problem
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Surrogate Constraints
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- A Generalized Machine-Scheduling Algorithm
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- A Direct Search Method to Locate Negative Cycles in a Graph
- A Method of Solution for General Machine-Scheduling Problems
- Algorithms for Solving Production-Scheduling Problems
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
- Job Shop Scheduling by Local Search
- Improving local search heuristics for some scheduling problems. II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
