A common approximation framework for early work, late work, and resource leveling problems (Q2184097): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3680271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling problems with late work criteria. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine flow-shop problem with weighted late work criterion and common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the two machine job shop with the weighted late work criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on parallel identical machines with late work criterion: offline and online cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource leveling in a machine environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling a single machine to minimize total late work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling to Minimize Total Late Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer linear programming for resource leveling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work / rank
 
Normal rank
Property / cites work
 
Property / cites work: A metaheuristic solution approach for the time-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on scheduling two parallel machines with capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank

Revision as of 18:52, 22 July 2024

scientific article
Language Label Description Also known as
English
A common approximation framework for early work, late work, and resource leveling problems
scientific article

    Statements

    A common approximation framework for early work, late work, and resource leveling problems (English)
    0 references
    0 references
    0 references
    27 May 2020
    0 references
    scheduling
    0 references
    late work minimization
    0 references
    early work maximization
    0 references
    resource leveling
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers