Two simulated annealing-based heuristics for the job shop scheduling problem
From MaRDI portal
Publication:1806614
DOI10.1016/S0377-2217(98)00326-9zbMath0933.90031OpenAlexW2022719115WikidataQ127976327 ScholiaQ127976327MaRDI QIDQ1806614
C. K. Wong, K. Steinhöfel, Andreas A. Albrecht
Publication date: 4 April 2000
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)00326-9
Related Items (13)
Ant colony optimisation with parameterised search space for the job shop scheduling problem ⋮ A very fast TS/SA algorithm for the job shop scheduling problem ⋮ Solving the job-shop scheduling problem optimally by dynamic programming ⋮ Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters ⋮ Firefly-Inspired Algorithm for Job Shop Scheduling ⋮ Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis ⋮ Augmented neural networks for task scheduling. ⋮ An experimental analysis of local minima to improve neighbourhood search. ⋮ Speed-up simulated annealing by parallel coordinates ⋮ A sequencing approach for creating new train timetables ⋮ Fast parallel heuristics for the job shop scheduling problem ⋮ A hybrid method for solving stochastic job shop scheduling problems ⋮ The convergence of stochastic algorithms solving flow shop scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Efficient simulated annealing on fractal energy landscapes
- NP-complete scheduling problems
- Scheduling: theory and applications
- Stochastic simulations of two-dimensional composite packings
- Current trends in deterministic scheduling
- Single machine scheduling with batch set-up times to minimize maximum lateness
- Single machine hierarchical scheduling with customer orders and multiple job classes
- A single machine scheduling problem with common due window and controllable processing times
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing
- Focused simulated annealing search: An application to job shop scheduling
- Applying tabu search to the job-shop scheduling problem
- Single machine scheduling subject to precedence delays
- A theoretical framework for simulated annealing
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Cooling Schedules for Optimal Annealing
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Stochastic Scheduling with Variable Profile and Precedence Constraints
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Equation of State Calculations by Fast Computing Machines
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Job Shop Scheduling by Local Search
- On Unapproximable Versions of $NP$-Complete Problems
This page was built for publication: Two simulated annealing-based heuristics for the job shop scheduling problem
