Minimizing total weighted late work in the resource-constrained project scheduling problem

DOI10.1016/j.apm.2013.05.013zbMath1427.90157OpenAlexW2052491497MaRDI QIDQ1792320

Yanyan Li

Publication date: 11 October 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2013.05.013

zbMATH Keywords

branch-and-boundresource-constrained project schedulinglate work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A quantitative approach for the long-term assessment of railway rapid transit network construction or expansion projects ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems ⋮ Stochastic project scheduling with hierarchical alternatives ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Mirror scheduling problems with early work and late work criteria

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A neurogenetic approach for the resource-constrained project scheduling problem
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• A note on the two machine job shop with the weighted late work criterion
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• Open shop scheduling problems with late work criteria.
• Project scheduling. A research handbook.
• An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
• The two-machine flow-shop problem with weighted late work criterion and common due date
• The multiple resource constrained project scheduling problem: A breadth-first approach
• Recent results on resource-constrained project scheduling with time windows: Models, solution methods, and applications
• Using metaheuristics in multiobjective resource constrained project scheduling
• Scheduling an R&D Project with Quality-Dependent Time Slots
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Single Machine Scheduling to Minimize Total Weighted Late Work
• An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem

This page was built for publication: Minimizing total weighted late work in the resource-constrained project scheduling problem