scientific article
From MaRDI portal
zbMath0693.90047MaRDI QIDQ3468865
Rolf H. Möhring, M. Bartusch, F. J. Radermacher
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch-and-boundjob shop schedulingtime windowsComputational experienceprecedence constrained schedulingMPM networksdisjunctive graph methodorder theoretic methodsProject networks
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items
Heuristics for scheduling resource-constrained projects in MPM networks, On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations, Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities, A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations, Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming, The sample analysis machine scheduling problem: definition and comparison of exact solving approaches, How to make OR-results available: A proposal for project scheduling, Scatter search with path relinking for the job shop with time lags and setup times, Resource-constrained project scheduling with flexible resource profiles in continuous time, Modelling and solving generalised operational surgery scheduling problems, On the integration of diverging material flows into resource-constrained project scheduling, An exact algorithm for project scheduling with multiple modes, Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production, Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors, A compact reformulation of the two-stage robust resource-constrained project scheduling problem, Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem, Mixed-integer linear programming for resource leveling problems, Optimizing the supply chain configuration for make-to-order manufacturing, The total adjustment cost problem: applications, models, and solution algorithms, \(\Gamma\)-robust optimization of project scheduling problems, New concepts for activity float in resource-constrained project management, Lower bounds for resource-constrained project scheduling problems., Order-based neighborhoods for project scheduling with nonregular objective functions., Integrated truck and workforce scheduling to accelerate the unloading of trucks, A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints, Resource-constrained project scheduling: A survey of recent developments., Robust execution strategies for project scheduling with unreliable resources and stochastic durations, A lexicographic approach to the robust resource-constrained project scheduling problem, Solving RCPSP/max by lazy clause generation, Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres, An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations, Dismantling of nuclear power plants at optimal NPV, A min-flow algorithm for minimal critical set detection in resource constrained project scheduling, An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags, A memetic algorithm for the job-shop with time-lags, Optimizing version release dates of research and development long-term processes, Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems, A note on the paper Resource-constraint project scheduling: Notation, classification, models and methods by Bruckner et al, A branch‐and‐bound algorithm for scheduling of new product development projects, The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm, Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay., A hybrid framework for over-constrained generalized resource-constrained project scheduling problems, A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations, A double genetic algorithm for the MRCPSP/max, Scheduling of continuous and discontinuous material flows with intermediate storage restrictions, Solve-and-robustify, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models, Iterative Flattening Search on RCPSP/max Problems: Recent Developments, Fast reoptimization for the minimum spanning tree problem, Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods), A survey of variants and extensions of the resource-constrained project scheduling problem, A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints, A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time, Scheduling with forbidden sets, 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, Deterministic job-shop scheduling: Past, present and future, An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations, Modelling setup times, process batches and transfer batches using activity network logic, Immediate schedule adjustment and semidefinite relaxation, A newany-orderschedule generation scheme for resource-constrained project scheduling, Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities, The resource-constrained activity insertion problem with minimum and maximum time lags, Resource allocation by means of project networks: Dominance results, Resource allocation by means of project networks: Complexity results, Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application, Reoptimization of minimum and maximum traveling salesman's tours, Computing latest starting times of activities in interval-valued networks with minimal time lags, A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags, A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem, A branch and bound algorithm for the resource-constrained project scheduling problem, A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations, Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints, Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag, A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
