Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4226540506 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2004.00518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated scheduling of customer orders for quick response / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for scheduling conflicting jobs with minsum criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multiprocessor Scheduling with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order Scheduling Models: Hardness and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation Guarantees for Job-Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling orders for multiple product types to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of weighted completion times in a concurrent open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling on multiple machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unrelated Machines by Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Weighted Completion Time Scheduling of Parallel Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank

Latest revision as of 07:28, 31 July 2024

scientific article; zbMATH DE number 7640301
Language Label Description Also known as
English
Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints
scientific article; zbMATH DE number 7640301

    Statements

    Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (English)
    0 references
    0 references
    0 references
    10 January 2023
    0 references
    scheduling algorithms
    0 references
    approximation algorithms
    0 references
    data-parallel computing
    0 references
    datacenters
    0 references
    0 references

    Identifiers