An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10951-016-0468-y / rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6653506 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
uncertain processing times | |||
Property / zbMATH Keywords: uncertain processing times / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complexity | |||
Property / zbMATH Keywords: complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
robustness | |||
Property / zbMATH Keywords: robustness / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
mixed-criticality | |||
Property / zbMATH Keywords: mixed-criticality / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
ILP | |||
Property / zbMATH Keywords: ILP / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
match-up | |||
Property / zbMATH Keywords: match-up / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
packing | |||
Property / zbMATH Keywords: packing / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
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 | |||
Property / DOI | |||
Property / DOI: 10.1007/S10951-016-0468-Y / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:08, 9 December 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
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
0 references