Pages that link to "Item:Q1870022"
From MaRDI portal
The following pages link to On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022):
Displayed 35 items.
- Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) (← links)
- New results on two-machine flow-shop scheduling with rejection (Q281786) (← links)
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334) (← links)
- Parallel-machine scheduling with release dates and rejection (Q295880) (← links)
- Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times (Q456108) (← links)
- Order acceptance and scheduling with consideration of service level (Q513576) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
- New approximation algorithms for machine scheduling with rejection on single and parallel machine (Q830930) (← links)
- Optimally competitive list batching (Q837154) (← links)
- On-line scheduling with rejection on identical parallel machines (Q882532) (← links)
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
- Scheduling linear deteriorating jobs with rejection on a single machine (Q953419) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- Bounded single-machine parallel-batch scheduling with release dates and rejection (Q1017446) (← links)
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
- On-line scheduling of unit time jobs with rejection on uniform machines (Q1031971) (← links)
- Single machine scheduling with release dates and rejection (Q1042081) (← links)
- Scheduling problems with rejection to minimize the maximum flow time (Q1691942) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
- Online file caching with rejection penalties (Q2346958) (← links)
- Scheduling with rejection and non-identical job arrivals (Q2425836) (← links)
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843) (← links)
- Bin packing problems with rejection penalties and their dual problems (Q2495654) (← links)
- An improved heuristic for parallel machine scheduling with rejection (Q2629711) (← links)
- Scheduling with partial rejection (Q2661510) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- On Variants of File Caching (Q3012805) (← links)
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection (Q3541120) (← links)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
- TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION (Q5411726) (← links)
- Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan (Q6113846) (← links)
- On-line single machine scheduling with release dates and submodular rejection penalties (Q6167007) (← links)
