Exact and approximate methods for parallel multiple-area spatial scheduling with release times (Q2393121): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58839255, #quickstatements; #temporary_batch_1712111774907
Created claim: DBLP publication ID (P1635): journals/ors/GarciaR13, #quickstatements; #temporary_batch_1731508824982
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical model for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of adjacent resource scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent-Resource Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-constrained project scheduling with adjacent resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing small boxes into a big box. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional bin packing problem with variable bin height / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ors/GarciaR13 / rank
 
Normal rank

Latest revision as of 16:09, 13 November 2024

scientific article
Language Label Description Also known as
English
Exact and approximate methods for parallel multiple-area spatial scheduling with release times
scientific article

    Statements

    Exact and approximate methods for parallel multiple-area spatial scheduling with release times (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2013
    0 references
    spatial scheduling
    0 references
    integer programming
    0 references
    heuristic
    0 references
    release times
    0 references

    Identifiers