Pages that link to "Item:Q896271"
From MaRDI portal
The following pages link to Scheduling and fixed-parameter tractability (Q896271):
Displayed 37 items.
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
- On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
- Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times (Q2094381) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
- A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- Fixed-Parameter Approximation Schemes for Weighted Flowtime. (Q5009522) (← links)
- (Q5111743) (← links)
- Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
- (Q6068238) (← links)
- (Q6089672) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)
- On the complexity of scheduling problems with a fixed number of parallel identical machines (Q6169524) (← links)