Scheduling on parallel machines with preemption and transportation delays (Q1761986): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.04.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045358932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4380372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Preemptive Scheduling on Two-Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with transportation considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution of a scheduling problem in a flowshop robotic cell / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: UET scheduling with unit interprocessor communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling in the presence of transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of hard real-time scheduling for multiprocessor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportionate progress: A notion of fairness in resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling three chains on two parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank

Latest revision as of 22:04, 5 July 2024

scientific article
Language Label Description Also known as
English
Scheduling on parallel machines with preemption and transportation delays
scientific article

    Statements

    Scheduling on parallel machines with preemption and transportation delays (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    transportation delays
    0 references
    preemption
    0 references
    NP-completeness
    0 references
    dynamic program
    0 references
    FPTAS
    0 references

    Identifiers