Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
type: Item
instance of: scholarly article
title: Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
zbMATH Open document ID: 0842.90062
DOI: 10.1007/BF01719262
author: V. Jorge Leon
author: Ramamoorthy Balakrishnan
published in: OR Spektrum
publication date: 1996-08-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 853149
zbMATH Keywords: resource constrained scheduling
zbMATH Keywords: scheduling activities on scarce resources
zbMATH Keywords: makespan
zbMATH Keywords: mean tardiness
MaRDI profile type: Publication
cites work: Some efficient multi-heuristic procedures for resource-constrained project scheduling
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: Scheduling of Project Networks by Job Assignment
cites work: Algorithms for Solving Production-Scheduling Problems
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Resource-constrained Project Scheduling — The State of the Art
cites work: Q3785827
cites work: Q4739657
cites work: Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
cites work: Q4201451
cites work: Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
description: scientific article; zbMATH DE number 853149