Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
From MaRDI portal
Publication:1372767
DOI10.1007/BF01545589zbMATH Open0885.90058OpenAlexW2071509693MaRDI QIDQ1372767FDOQ1372767
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
Cites work
- scientific article; zbMATH DE number 4135692 (Why is no real title available?)
- scientific article; zbMATH DE number 3473515 (Why is no real title available?)
- scientific article; zbMATH DE number 3599820 (Why is no real title available?)
- scientific article; zbMATH DE number 201035 (Why is no real title available?)
- scientific article; zbMATH DE number 864788 (Why is no real title available?)
- 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
- 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)
Cited in
(17)- Order-based neighborhoods for project scheduling with nonregular objective functions.
- On the integration of diverging material flows into resource-constrained project scheduling
- 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
- A hybrid framework for over-constrained generalized resource-constrained project scheduling problems
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
- Solving RCPSP/max by lazy clause generation
- An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
- The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm
- Optimizing the supply chain configuration for make-to-order manufacturing
- Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
- A new approach for solving the network problems
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
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)
