A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290): Difference between revisions

From MaRDI portal
RedirectionBot (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 / OpenAlex ID
 
Property / OpenAlex ID: W2612049039 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1510.04833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a parallel machine scheduling problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine precedence constrained scheduling is a Vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Single-Machine Scheduling with Precedence Constraints / 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: 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: On preemption redundancy in scheduling unit processing time jobs on two parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional dimension of partial orders / 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: Q3425131 / 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: A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling identical jobs with chain precedence constraints on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal-form preemption sequences for an open problem in scheduling theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding ideal schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal preemptive schedules on two processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / 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: Scheduling preemptive jobs with precedence constraints on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling precedence graphs of bounded height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profile Scheduling of Opposing Forests and Level Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parametric complexity of schedules to minimize tardy tasks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph width measures in parameterized algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Opposing Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Preemptive Scheduling of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time for UET tasks with release time and outtree precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean flow time for UET tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling chain-structured tasks to minimize makespan and mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for scheduling chains on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on a Single Machine with Precedence Constraints / 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: Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and Fixed-Parameter Tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Scheduling on Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Series-Parallel Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling on parallel machines for a new order class / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relation between multiprocessor scheduling and linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal preemptive scheduling on a fixed number of identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Interval-Ordered Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling of interval orders is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Precedence Constrained Scheduling on Identical Machines / 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: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with precedence constraints and position-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank

Latest revision as of 06:44, 17 July 2024

scientific article
Language Label Description Also known as
English
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
scientific article

    Statements

    A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (English)
    0 references
    7 November 2018
    0 references
    scheduling
    0 references
    precedence constraints
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references