Non-preemptive Scheduling on Machines with Setup Times (Q3449852): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1504.07066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An online algorithm for a problem in scheduling with set-ups and release times / 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: Non-preemptive Scheduling on Machines with Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling of two-phase flows with surface tension by finite pointset method (FPM) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-dimensional bin packing problem with shelf divisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on dual approximation algorithms for class constrained bin packing problems / rank
 
Normal rank

Latest revision as of 00:26, 11 July 2024

scientific article
Language Label Description Also known as
English
Non-preemptive Scheduling on Machines with Setup Times
scientific article

    Statements

    Identifiers