Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting (Q337299): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 14:46, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting	scientific article

Statements

scholarly article

0 references

Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting (English)

0 references

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

10 November 2016

0 references

zbMATH Keywords

resource-constrained project scheduling

0 references

preemption

0 references

calendarization

0 references

activity splitting

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2014.04.018

0 references

Pre-emption in resource-constrained project scheduling

0 references

Scheduling projects with limited number of preemptions

0 references

Project Scheduling Under Partially Renewable Resource Constraints

0 references

Complex Scheduling

0 references

Resource-constrained project scheduling: Notation, classification, models, and methods

0 references

Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting

0 references

Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting

0 references

Linear programming based algorithms for preemptive and non-preemptive RCPSP

0 references

An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem

0 references

Project scheduling with calendars

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Work patterns in project scheduling

0 references

Project scheduling under limited resources. Models, methods, and applications

0 references

Project scheduling with multiple modes: A comparison of exact algorithms

0 references

Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

0 references

A survey of variants and extensions of the resource-constrained project scheduling problem

0 references

Resource-constrained project scheduling: A survey of recent developments.

0 references

A note on the paper ''Resource-constraint project scheduling: Notation, classification, models and methods'' by Bruckner et al

0 references

Project scheduling with time-varying resource constraints

0 references

PSPLIB -- a project scheduling problem library

0 references

Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

0 references

Application of a Technique for Research and Development Program Evaluation

0 references

0 references

A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem

0 references

0 references

Hierarchical models for multi-project planning and scheduling

0 references

Resource-constrained project scheduling. Exact methods for the multi-mode case

0 references

An exact algorithm for project scheduling with multiple modes

0 references

Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm

0 references

Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case

0 references

0 references

Project scheduling with finite or infinite number of activity processing modes -- a survey

0 references

A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem

0 references

Improved On-Line Broadcast Scheduling with Deadlines

0 references

Lower bounds on online deadline scheduling with preemption penalties

0 references

On-line scheduling on a single machine: Maximizing the number of early jobs

0 references

Preemptive scheduling with release dates, delivery times and sequence independent setup times

0 references

0 references

Scheduling with job release dates, delivery times and preemption penalties

0 references

Minimizing total completion time subject to job release dates and preemption penalties

0 references

A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times

0 references

Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times

0 references

On-line production order scheduling with preemption penalties

0 references

Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem

0 references

The multi-mode resource-constrained project scheduling problem with generalized precedence relations

0 references

A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.COR.2014.04.018

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:337299

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q337299&oldid=38310486"