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

DOI10.1007/BF01545589zbMATH Open0885.90058OpenAlexW2071509693MaRDI QIDQ1372767FDOQ1372767

Authors: Klaus Neumann, Christoph Schwindt 

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

Recommendations

• Criticality analysis in activity-on-node networks with minimal time lags
• Optimising waiting at nodes in time-dependent networks: cost functions and applications
• Time-dependent order and distribution policies in supply networks
• Solving time-cost trade-off model for activity network by minimum cost flow principle
• A maximal flow algorithm for the manufacturing network
• Estimating completion-time distribution in stochastic activity networks
• Computing latest starting times of activities in interval-valued networks with minimal time lags
• On the latest starting times and criticality of activities in a network with imprecise durations
• On optimizing production nodes in supply chain systems
• Modeling and heuristics for production time crashing in supply chain network design

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)

Cites Work

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

Cited In (17)

• The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm
• An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
• An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem
• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
• A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
• A hybrid framework for over-constrained generalized resource-constrained project scheduling problems
• Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
• 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
• Iterative Flattening Search on RCPSP/max Problems: Recent Developments
• On the integration of diverging material flows into resource-constrained project scheduling
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Optimizing the supply chain configuration for make-to-order manufacturing
• Solving RCPSP/max by lazy clause generation
• Order-based neighborhoods for project scheduling with nonregular objective functions.
• A new approach for solving the network 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372767)