An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem

DOI10.1080/00207540701420560zbMath1154.90353MaRDI QIDQ3605435

Norbert Trautmann, Francisco Ballestín

Publication date: 24 February 2009

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701420560

zbMATH Keywords

reactive scheduling; resource-constrained project scheduling; just-in-time production; iterated-local-search; weighted earliness-tardiness cost

Mathematics Subject Classification ID

90B30: Production models

Related Items

Resource constraint scheduling with a fractional shared resource, Scheduling projects with limited number of preemptions

Cites Work

• A decomposition approach for a resource constrained scheduling problem
• A decomposition approach in a DSS for a resource constrained scheduling problem
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• Resource-constrained project scheduling: A critical activity reordering heuristic
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Advanced production scheduling for batch plants in process industries
• Scheduling of Project Networks by Job Assignment
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem