Scheduling and fixed-parameter tractability
type: Item
instance of: scholarly article
title: Scheduling and fixed-parameter tractability
zbMATH Open document ID: 1332.68089
author: Matthias Mnich
author: Andreas Wiese
published in: Mathematical Programming. Series A. Series B
publication date: 2015-12-09T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6518229
zbMATH Keywords: scheduling
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: integer linear programming
MaRDI profile type: Publication
full work available at URL: s10107-014-0830-9
OpenAlex ID: W2168633992
cites work: Preemptive scheduling with rejection
cites work: Approximation schemes for scheduling on parallel machines
cites work: Color-coding
cites work: Q4471337
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
cites work: Parameterized complexity of a coupled-task scheduling problem
cites work: \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
cites work: A framework for the complexity of high-multiplicity scheduling problems
cites work: Approximation schemes for preemptive weighted flow time
cites work: Algorithms for minimizing weighted flow time
cites work: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: Q3579372
cites work: Techniques for scheduling with rejection
cites work: Parameterizing by the number of numbers
cites work: Q4279511
cites work: On the parametric complexity of schedules to minimize tardy tasks.
cites work: Tighter Bounds for the Multifit Processor Scheduling Algorithm
cites work: Q4198056
cites work: Polynomiality for Bin Packing with a Constant Number of Item Types
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Complexity of integer quasiconvex polynomial optimization
cites work: Bin packing with fixed number of bins revisited
cites work: On the Complexity of Nonlinear Mixed-Integer Optimization
cites work: An approximation algorithm for the generalized assignment problem
cites work: Q4124328
cites work: Stable assignment with couples: parameterized complexity and local search
cites work: Scheduling and Fixed-Parameter Tractability
cites work: Algorithms for Scheduling Independent Tasks
cites work: Santa Claus Schedules Jobs on Unrelated Machines
cites work: Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
DOI: 10.1007/S10107-014-0830-9
Recommended article: Scheduling and Fixed-Parameter Tractability
Recommended article: Q4473910
Recommended article: Approximability of scheduling with fixed jobs
Recommended article: Fixed interval scheduling: models, applications, computational complexity and algorithms
Recommended article: Complexity of a class of task scheduling problems
Recommended article: On the optimality of exact and approximation algorithms for scheduling problems
Recommended article: Towards Tight Lower Bounds for Scheduling Problems
Recommended article: On approximating a scheduling problem
Recommended article: Q4527188
Recommended article: Scheduling and constraint propagation
description: scientific article; zbMATH DE number 6518229