Scheduling with cardinality dependent unavailability periods

Cites work

A comment on scheduling two parallel machines with capacity constraints
A two-machine flowshop scheduling problem with a separated maintenance constraint
AFPTAS results for common variants of bin packing: a new method for handling the small items
An FPTAS for scheduling a two-machine flowshop with one unavailability interval
An efficient PTAS for parallel machine scheduling with capacity constraints
Approximating Scheduling Machines with Capacity Constraints
Approximation algorithms for knapsack problems with cardinality constraints
Approximation schemes for machine scheduling with resource (in-)dependent processing times
Approximation schemes for ordered vector packing problems
Bin packing can be solved within 1+epsilon in linear time
Bounds for the cardinality constrained \(P \|C_{max}\) problem
Cardinality constrained bin-packing problems
Cardinality constrained scheduling in online models
Cost allocation in rescheduling with machine unavailable period
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
Fundamentals of parameterized complexity
Improved algorithms for two single machine scheduling problems
Integer Programming with a Fixed Number of Variables
Minimizing makespan for two parallel machines with job limit on each availability interval
On the efficiency of polynomial time approximation schemes
Parametrized complexity theory.
Preemptive scheduling with availability constraints to minimize total weighted completion times
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
Rescheduling for machine disruption to minimize makespan and maximum lateness
Scheduling on semi-identical processors
Scheduling with limited machine availability
Scheduling with time-changing effects and rate-modifying activities
Single-machine scheduling with periodic maintenance to minimize makespan
Single-machine scheduling with periodic maintenance to minimize makespan revisited
Using fast matrix multiplication to find basic solutions

This page was built for publication: Scheduling with cardinality dependent unavailability periods

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