Parallel machine scheduling problem with preemptive jobs and transportation delay (Q337061): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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.1016/j.cor.2014.04.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017026412 / 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: Preemptive scheduling in the presence of transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on parallel machines with preemption and transportation delays / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:47, 12 July 2024

scientific article
Language Label Description Also known as
English
Parallel machine scheduling problem with preemptive jobs and transportation delay
scientific article

    Statements

    Parallel machine scheduling problem with preemptive jobs and transportation delay (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    scheduling
    0 references
    parallel machine scheduling
    0 references
    transportation delays
    0 references
    migration delay
    0 references
    preemption
    0 references
    minimization of makespan
    0 references
    mathematical modeling
    0 references

    Identifiers