Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production

DOI10.1007/BF01545589zbMath0885.90058OpenAlexW2071509693MaRDI QIDQ1372767

Christoph Schwindt, Klaus Neumann

Publication date: 30 October 1997

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

Full work available at URL: https://doi.org/10.1007/bf01545589

zbMATH Keywords

projectsmake-to-order productioncyclic activity-on-node networksmaximal time lags

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (16)

Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars ⋮ On the integration of diverging material flows into resource-constrained project scheduling ⋮ A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags ⋮ Optimizing the supply chain configuration for make-to-order manufacturing ⋮ Order-based neighborhoods for project scheduling with nonregular objective functions. ⋮ Solving RCPSP/max by lazy clause generation ⋮ A new approach for solving the network problems ⋮ The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm ⋮ A hybrid framework for over-constrained generalized resource-constrained project scheduling problems ⋮ Iterative Flattening Search on RCPSP/max Problems: Recent Developments ⋮ An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Resource levelling for projects with schedule-dependent time windows ⋮ The multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristics for scheduling resource-constrained projects in MPM networks
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems

This page was built for publication: Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production