A new LP-based lower bound for the cumulative scheduling problem (Q1590042): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling. Exact methods for the multi-mode case / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(99)00494-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053615234 / rank
 
Normal rank

Latest revision as of 09:40, 30 July 2024

scientific article
Language Label Description Also known as
English
A new LP-based lower bound for the cumulative scheduling problem
scientific article

    Statements

    A new LP-based lower bound for the cumulative scheduling problem (English)
    0 references
    0 references
    0 references
    19 December 2000
    0 references
    0 references
    linear programming
    0 references
    resource constraints
    0 references
    0 references