Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling

DOI10.1007/BF01719262zbMath0842.90062MaRDI QIDQ1909005

Ramamoorthy Balakrishnan, V. Jorge Leon

Publication date: 6 August 1996

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

makespanresource constrained schedulingmean tardinessscheduling activities on scarce resources

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

An adaptive scheduling algorithm for a parallel machine problem with rework processes, Experimental investigation of heuristics for resource-constrained project scheduling: an update, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Metaheuristics: A bibliography, Resource-constrained project scheduling: A critical activity reordering heuristic, Order-based neighborhoods for project scheduling with nonregular objective functions., An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem, A random key based genetic algorithm for the resource constrained project scheduling problem, Case-based reasoning and improved adaptive search for project scheduling, Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem, An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem, Scheduling and constraint propagation, A neurogenetic approach for the resource-constrained project scheduling problem, A survey of hybrid metaheuristics for the resource-constrained project scheduling problem, A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem, Resource-constrained project scheduling: Notation, classification, models, and methods, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, An efficient multi-pass heuristic for project scheduling with constrained resources, Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem, Tabu search for resource-constrained scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• Scheduling subject to resource constraints: Classification and complexity
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Scheduling of Project Networks by Job Assignment
• Tabu Search—Part I
• Tabu Search—Part II
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Resource-constrained Project Scheduling — The State of the Art
• Algorithms for Solving Production-Scheduling Problems