An exact algorithm for the identical parallel machine scheduling problem. (Q1416605): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the unrelated parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: List scheduling algorithms to minimize the makespan on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed 0-1 programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:27, 6 June 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the identical parallel machine scheduling problem.
scientific article

    Statements

    Identifiers