A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SPEA2 / 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/s40314-015-0298-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2194257274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling on identical parallel machines subject to deadlines. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemption in single machine earliness/tardiness scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Algorithms for Solving Multi-Objective Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with early and tardy completion costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with splitting jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling preemptive jobs with precedence constraints on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recovering beam search algorithm for the single machine just-in-time scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Experimental Data for Computational Testing with Machine Scheduling Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine just-in-time scheduling problem with preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with target start times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Just-in-time scheduling. Models and algorithms for computer and manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling on uniform machines to minimize mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some dominance properties for single-machine tardiness problems with sequence-dependent setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new model for the preemptive earliness-tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine problem with earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine earliness and tardiness scheduling with proportional weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs / rank
 
Normal rank

Latest revision as of 10:29, 14 July 2024

scientific article
Language Label Description Also known as
English
A multi-objective optimization for preemptive identical parallel machines scheduling problem
scientific article

    Statements

    A multi-objective optimization for preemptive identical parallel machines scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    15 September 2017
    0 references
    0 references
    earliness and tardiness
    0 references
    just-in-time
    0 references
    identical parallel machines
    0 references
    preemption
    0 references
    non-dominated sorting genetic algorithm
    0 references
    0 references
    0 references
    0 references