Empowering the configuration-IP: new PTAS results for scheduling with setup times
type: Item
instance of: scholarly article
title: Empowering the configuration-IP: new PTAS results for scheduling with setup times
author: Klaus Jansen
author: Kim-Manuel Klein
author: Marten Maack
author: Malin Rau
published in: Mathematical Programming. Series A. Series B
publication date: 2022-10-24T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7606020
zbMATH Keywords: parallel machines
zbMATH Keywords: setup time
zbMATH Keywords: EPTAS
zbMATH Keywords: \(n\)-fold integer programming
MaRDI profile type: Publication
full work available at URL: s10107-021-01694-3
OpenAlex ID: W2964184266
cites work: The third comprehensive survey on scheduling problems with setup times/costs
cites work: A survey of scheduling problems with setup times or costs
cites work: Approximation schemes for scheduling on parallel machines
cites work: A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
cites work: Lot-sizing scheduling with batch setup times
cites work: Q4636620
cites work: Strong LP formulations for scheduling splittable jobs on unrelated machines
cites work: Splitting versus setup trade-offs for scheduling to minimize weighted completion time
cites work: Faster Algorithms for Integer Programs with Block Structure
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Polynomiality for Bin Packing with a Constant Number of Item Types
cites work: \(n\)-fold integer programming in cubic time
cites work: Q5090421
cites work: Closing the Gap for Makespan Scheduling via Sparsification Techniques
cites work: Non-preemptive scheduling with setup times: a PTAS
cites work: Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: Scheduling meets \(n\)-fold integer programming
cites work: Combinatorial \(n\)-fold integer programming and applications
cites work: A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
cites work: Integer Programming with a Fixed Number of Variables
cites work: Q4904855
cites work: Non-preemptive Scheduling on Machines with Setup Times
cites work: Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
cites work: Nonlinear discrete optimization. An algorithmic theory
cites work: Split scheduling with uniform setup times
cites work: Q4252357
DOI: 10.1007/S10107-021-01694-3
description: scientific article; zbMATH DE number 7606020