Parallel machine problems with equal processing times: a survey (Q2434248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57633861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling of equal-length jobs to maximize weighted throughput. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean flow time scheduling problems with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal processing time jobs to minimize the weighted number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times and time windows on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch machine production with perishability time windows and limited batch size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling equal-length jobs to maximize throughput / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling identical jobs on uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of Equal-Length Jobs on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Total Unimodularity in Optimization Problems Solved by Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stability problem of broadcast packet switching computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of Two Equivalent Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs with parallel nested machine processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of equal-processing-time task systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of minimizing the number of late jobs in unit time open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a parallel machine scheduling problem with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of machines for scheduling jobs with equal processing times / 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: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling to minimize mean weighted flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion scheduling with equal processing times on a batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to multi-parameter complexity analysis of discrete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better algorithm for sequencing with release and delivery times on identical machines / rank
 
Normal rank

Latest revision as of 08:30, 7 July 2024

scientific article
Language Label Description Also known as
English
Parallel machine problems with equal processing times: a survey
scientific article

    Statements

    Parallel machine problems with equal processing times: a survey (English)
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel machine problem
    0 references
    equal processing times
    0 references
    non-preemptive problems
    0 references
    preemptive problems
    0 references
    polynomial algorithms
    0 references
    NP-hard problems
    0 references
    0 references
    0 references
    0 references
    0 references