An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-016-0468-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2299839370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine match-up scheduling with manufacturing cost considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Real-Time Mixed-Criticality Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2735585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust approach for the single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Mixed-Criticality Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with preemption or non-completion penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for a scheduling problem with rejection and tardiness penalties / rank
 
Normal rank

Latest revision as of 22:45, 12 July 2024

scientific article
Language Label Description Also known as
English
An analysis of the non-preemptive mixed-criticality match-up scheduling problem
scientific article

    Statements

    An analysis of the non-preemptive mixed-criticality match-up scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    16 November 2016
    0 references
    uncertain processing times
    0 references
    scheduling
    0 references
    complexity
    0 references
    robustness
    0 references
    mixed-criticality
    0 references
    ILP
    0 references
    match-up
    0 references
    packing
    0 references

    Identifiers