scientific article; zbMATH DE number 3688701

MaRDI QIDQ3883482zbMATH OpenFDO

Authors Jan Węglarz

Publication date 1980

zbMATH Keywords

computer and job shop schedulingresource allocation in computer systemssurveytask and project scheduling

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25)

Cited in

(10)

• A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
• Scheduling projects with variable-intensity activities: The case of dynamic earliness and tardiness costs
• A local constraint based analysis approach to project scheduling under general resource constraints
• A flexible heuristic for a multi-mode capital constrained project scheduling problem with probabilistic cash inflows
• Resource-constrained project scheduling by simulated annealing
• A constraint-based perspective in resource constrained project scheduling
• Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
• A Benders decomposition algorithm for the multi-mode resource-constrained multi-project scheduling problem with uncertainty
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints

This page was built for publication:

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