A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s13675-017-0086-2 / 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.1007/s13675-017-0086-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2616611648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch Scheduling of Deteriorating Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling of step deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic priority rules for cyclic-type queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertices on a Permutohedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling deteriorating jobs to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: V-Shaped Policies for Scheduling Deteriorating Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation polyhedra and minimisation of the variance of completion times on a single machine / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S13675-017-0086-2 / rank
 
Normal rank

Latest revision as of 07:31, 11 December 2024

scientific article
Language Label Description Also known as
English
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
scientific article

    Statements

    A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (English)
    0 references
    0 references
    0 references
    0 references
    12 April 2018
    0 references
    permutation polyhedra
    0 references
    adjacency
    0 references
    dominance
    0 references
    local search
    0 references
    deteriorating jobs
    0 references
    relaxed agreeable weights
    0 references

    Identifiers