Pages that link to "Item:Q1698078"
From MaRDI portal
The following pages link to Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078):
Displayed 10 items.
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- Single machine lot scheduling with optional job-rejection (Q2025088) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
- Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties (Q2168731) (← links)
- Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
- Algorithms for single machine scheduling problem with release dates and submodular penalties (Q6039534) (← links)
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection (Q6103749) (← links)
- On-line single machine scheduling with release dates and submodular rejection penalties (Q6167007) (← links)
- Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)
