On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-007-0266-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979626969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cyclic shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / 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 with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a linear programming heuristic for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Little-preemptive scheduling on unrelated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:04, 28 June 2024

scientific article
Language Label Description Also known as
English
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
scientific article

    Statements

    On the geometry, preemptions and complexity of multiprocessor and shop scheduling (English)
    0 references
    0 references
    0 references
    3 September 2008
    0 references
    0 references
    algorithm
    0 references
    shop scheduling
    0 references
    multiprocessor scheduling
    0 references
    time complexity
    0 references
    preemption
    0 references
    0 references