A characterization of optimal multiprocessor schedules and new dominance rules (Q830925): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-020-00634-9 / rank
Normal rank
 
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/s10878-020-00634-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3048379760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse scheduling with maximum lateness objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse scheduling: Two-machine flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bee colony optimization for scheduling independent tasks to identical processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest processing time rule for identical parallel machines revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Tasks on Identical Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for the identical parallel machine‐scheduling problem: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for the identical parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominance rules in combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an extension of the Sort \& Search method with application to scheduling theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and fixed-parameter tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the identical parallel machine scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite algorithm for multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approaches to the exact solution of the machine covering problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-020-00634-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:28, 10 December 2024

scientific article
Language Label Description Also known as
English
A characterization of optimal multiprocessor schedules and new dominance rules
scientific article

    Statements

    A characterization of optimal multiprocessor schedules and new dominance rules (English)
    0 references
    0 references
    0 references
    10 May 2021
    0 references
    scheduling
    0 references
    identical parallel machines
    0 references
    makespan
    0 references
    solution structure
    0 references
    dominance rules
    0 references
    0 references
    0 references

    Identifiers