Grouping techniques for scheduling problems: simpler and faster (Q930594): 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/s00453-007-9086-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000619341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent multiprocessor tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Coordination Complexity of Parallel Price-Directive Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Schemes for Scheduling Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time approximation schemes for scheduling malleable parallel tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for general multiprocessor job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan Minimization in Job Shops: A Linear Time Approximation Scheme / 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: Efficient approximation schemes for scheduling problems with release dates and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time approximation scheme for the single machine scheduling problem with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in open shops: A polynomial time approximation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some geometric methods in scheduling theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:58, 28 June 2024

scientific article
Language Label Description Also known as
English
Grouping techniques for scheduling problems: simpler and faster
scientific article

    Statements

    Grouping techniques for scheduling problems: simpler and faster (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2008
    0 references
    0 references
    0 references
    0 references
    0 references