Preemptive scheduling in the presence of transportation times (Q1010294): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Algorithms – ESA 2005 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3751359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4380372 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4326789 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4859840 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling parallel jobs to minimize the makespan / 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: Q4198056 / rank | |||
Normal rank |
Latest revision as of 11:30, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Preemptive scheduling in the presence of transportation times |
scientific article |
Statements
Preemptive scheduling in the presence of transportation times (English)
0 references
3 April 2009
0 references
identical parallel machines
0 references
makespan
0 references
preemption
0 references
transportation time
0 references
migration delay
0 references
heuristics
0 references
complexity
0 references