Simulated annealing for resource-constrained scheduling
type: Item
instance of: scholarly article
title: Simulated annealing for resource-constrained scheduling
zbMATH Open document ID: 0783.90052
DOI: 10.1016/0377-2217(93)90231-B
author: David E. Jeffcoat
author: Robert L. Bulfin
published in: European Journal of Operational Research
publication date: 1993-12-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 474824
zbMATH Keywords: heuristics
zbMATH Keywords: resource-constrained scheduling
zbMATH Keywords: simulated annealing
MaRDI profile type: Publication
cites work: Q3994799
cites work: Q3940840
cites work: Deadline scheduling of tasks with ready times and resource constraints
cites work: Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
cites work: Simulated Annealing – An Annotated Bibliography
cites work: Simultaneous Resource Scheduling to Minimize Weighted Flow Times
cites work: Simulated annealing: A tool for operational research
cites work: Heuristics for resource-constrained scheduling†
cites work: Q3793923
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Convergence of an annealing algorithm
cites work: A controlled search simulated annealing method for the single machine weighted tardiness problem
cites work: A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling
description: scientific article; zbMATH DE number 474824