Two simulated annealing-based heuristics for the job shop scheduling problem
type: Item
instance of: scholarly article
title: Two simulated annealing-based heuristics for the job shop scheduling problem
zbMATH Open document ID: 0933.90031
DOI: 10.1016/S0377-2217(98)00326-9
author: K. Steinhöfel
author: C. K. Wong
author: Andreas Albrecht
published in: European Journal of Operational Research
publication date: 2000-04-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1358078
zbMATH Keywords: heuristics
zbMATH Keywords: benchmark problem
zbMATH Keywords: simulated annealing-based algorithms
zbMATH Keywords: job shop scheduling
MaRDI profile type: Publication
cites work: Q3994799
cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing
cites work: Stochastic simulations of two-dimensional composite packings
cites work: A Computational Study of the Job-Shop Scheduling Problem
cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: Q4131987
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Optimal Stochastic Allocation of Machines under Waiting-Time Constraints
cites work: Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Single machine scheduling subject to precedence delays
cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints
cites work: Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
cites work: Single machine hierarchical scheduling with customer orders and multiple job classes
cites work: Cooling Schedules for Optimal Annealing
cites work: Single machine scheduling with batch set-up times to minimize maximum lateness
cites work: Q4398369
cites work: Optimization by Simulated Annealing
cites work: Q4858587
cites work: Scheduling: theory and applications
cites work: Current trends in deterministic scheduling
cites work: A single machine scheduling problem with common due window and controllable processing times
cites work: Stochastic Scheduling with Variable Profile and Precedence Constraints
cites work: Equation of State Calculations by Fast Computing Machines
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Q3525910
cites work: A theoretical framework for simulated annealing
cites work: Focused simulated annealing search: An application to job shop scheduling
cites work: Efficient simulated annealing on fractal energy landscapes
cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
cites work: NP-complete scheduling problems
cites work: Job Shop Scheduling by Local Search
cites work: Q3785827
cites work: Job Shop Scheduling by Simulated Annealing
cites work: On Unapproximable Versions of $NP$-Complete Problems
Wikidata QID: Q127976327
full work available at URL: s0377-2217(98)00326-9
OpenAlex ID: W2022719115
description: scientific article; zbMATH DE number 1358078