A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/s10951-015-0454-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2205180844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On preemption redundancy in scheduling unit processing time jobs on two parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: How useful are preemptive schedules? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete 4-parametric complexity classification of short shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge chromatic number of a directed/mixed multigraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two jobs with fixed and nonfixed routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop-scheduling problems with fixed and non-fixed machine orders of the jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of mixed shop scheduling problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine Super-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:14, 12 July 2024

scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
scientific article

    Statements

    A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (English)
    0 references
    0 references
    0 references
    13 May 2016
    0 references
    mixed-shop scheduling
    0 references
    polynomial-time algorithms
    0 references
    preemption
    0 references

    Identifiers