Serial batching to minimize the weighted number of tardy jobs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Polynomial kernels for weighted problems
New algorithms for minimizing the weighted number of tardy jobs on a single machine
Interval scheduling and colorful independent sets
Scheduling and fixed-parameter tractability
Scheduling with batching: Minimizing the weighted number of tardy jobs
Batching identical jobs
Parameterized complexity of machine scheduling: 15 open problems
Scheduling with batching: A review
On the parameterized tractability of single machine scheduling with rejection
A survey of scheduling with parallel batch (p-batch) processing
Combinatorial \(n\)-fold integer programming and applications
Scheduling meets \(n\)-fold integer programming
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
Losing Weight by Gaining Edges
Integer Programming with a Fixed Number of Variables
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
Algorithms for Scheduling Independent Tasks
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Scheduling Groups of Jobs on a Single Machine
Reducibility among Combinatorial Problems
Polynomiality for Bin Packing with a Constant Number of Item Types
Parameterized Algorithms
An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
A Functional Equation and its Application to Resource Allocation and Sequencing Problems
Scheduling

This page was built for publication: Serial batching to minimize the weighted number of tardy jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657883)