A simulated annealing approach to job shop scheduling using critical block transition operators

No abstract is available for this paper.

• Publication year

  1994

• Venue

  International Conference on Neural Networks

• Publication date

  1994-06-27

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/ICNN.1994.375033
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Branch and Bound Algorithm for the Job-Shop Scheduling Problem

  1994cited by this paper
• Genetic Algorithms and Very Fast Simulated Reannealing: A comparison

  1992cited by this paper
• Function Optimization Based On Advanced Simulated Annealing

  1992cited by this paper
• Job Shop Scheduling by Simulated Annealing

  1992cited by this paper
• A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems

  1992cited by this paper
• A Computational Study of the Job-Shop Scheduling Problem

  1991cited by this paper
• Conventional Genetic Algorithm for Job Shop Problems

  1991cited by this paper
• The Shifting Bottleneck Procedure for Job Shop Scheduling

  1988cited by this paper
• A block approach for single-machine scheduling with release dates and due dates

  1986cited by this paper
• A Survey of Scheduling Rules

  1977cited by this paper
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

  1969cited by this paper
• Algorithms for Solving Production-Scheduling Problems

  1960cited by this paper

• Efficient solutions to the placement and chaining problem of User Plane Functions in 5G networks

  2021cites this paper
• D 03454 Metaheuristics for Group Shop Scheduling

  2020cites this paper
• Lühike peenplaneerimise algoritmide ja

  2018cites this paper
• Swarm satellite mission scheduling & planning using Hybrid Dynamic Mutation Genetic Algorithm

  2017cites this paper
• A State-of-the-art Review of Job-Shop Scheduling Techniques

  2017cites this paper
• A Graph Algorithm for Efficient Performance Evaluation of a Job Shop

  2014cites this paper
• A Graph Algorithm for Efficient Performance Evaluation of a Job Shop

  2014cites this paper
• Efficient calculation of the makespan for job-shop systems without recirculation using max-plus algebra

  2014cites this paper
• Mathematical Models, Heuristics and Algorithms for Efficient Analysis and Performance Evaluation of Job Shop Scheduling Systems Using Max-Plus Algebraic Techniques

  2013cites this paper
• Scheduling and buffer reduction algorithm for job shop production systems

  2013cites this paper
• Hybridization of Genetic Algorithm with Parallel Implementation of Simulated Annealing for Job Shop Scheduling

  2012cites this paper
• Continuous Decision Making in Optimal Reservoir Operation Using DP-ANN 630

  2011influential citation
• A modified Ant Colony algorithm for the Job Shop Scheduling Problem to minimize makespan

  2010cites this paper
• Fifty years of scheduling: a survey of milestones

  2009cites this paper
• Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems

  2008cites this paper
• Optimal Job Shop Scheduling Performance Enhancement Through Computer Based Simulated Annealing Technique

  2007cites this paper
• The Problem of Using the Calculation of the Critical Path to Solver Instances of the Job Shop Scheduling Problem

  2007cites this paper
• Zastosowanie algorytmu symulowanego wyżarzania do optymalizacji harmonogramowania produkcji małoseryjnej

  2006cites this paper
• A New Algorithm That Obtains an Approximation of the Critical Path in the Job Shop Scheduling Problem

  2006cites this paper
• Experimental analysis in simulated annealing to scheduling problems when upper bounds are used

  2005influential citation
• Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem

  2005cites this paper
• Simulated Annealing with Restart to Job Shop Scheduling Problem Using Upper Bounds

  2004influential citation
• Adaptive Simulated Annealing for maximum temperature

  2003influential citation
• Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing

  2003cites this paper
• Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem

  2003cites this paper
• Metaheuristics for Group Shop Scheduling

  2002cites this paper
• Proceedings of the third International Workshop of the IFIP WG5.7 Special interest group on Advanced techniques in production planning & control : 24-25 February 2000, Florence, Italy

  2002cites this paper
• Scheduling of a Production Unit via Critical Block Neighbourhood Structures

  1999cites this paper
• Evolution-Based Scheduling of Computations and Communications on Distributed Memory Multicomputers

  1999cites this paper
• Deterministic job-shop scheduling: Past, present and future

  1999cites this paper
• A Review of Machine Scheduling: Complexity, Algorithms and Approximability

  1998cites this paper
• Solving the C/sub sum/ permutation flowshop scheduling problem by genetic local search

  1998cites this paper
• On merging sequencing and scheduling theory with genetic algorithms to solve stochastic job shops

  1997cites this paper
• Job shop scheduling

  1997cites this paper
• Exploring the Job-Shop Search Space with Genetic Algorithms

  1997cites this paper
• Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search

  1996cites this paper
• A fusion of crossover and local search

  1996cites this paper
• Scheduling by Genetic Local Search with Multi-Step Crossover

  1996cites this paper
• A genetic algorithm with multi-step crossover for job-shop scheduling problems

  1995cites this paper
• Chapter 7 Job-shop scheduling

  year unknowncites this paper