Pages that link to "Item:Q5958131"
From MaRDI portal
The following pages link to Preemptive multiprocessor scheduling with rejection (Q5958131):
Displayed 50 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)
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Order acceptance and scheduling with consideration of service level (Q513576) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines (Q817020) (← links)
- New approximation algorithms for machine scheduling with rejection on single and parallel machine (Q830930) (← links)
- On-line scheduling with rejection on identical parallel machines (Q882532) (← links)
- Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
- Online scheduling of unit jobs on three machines with rejection: a tight result (Q903197) (← links)
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Scheduling linear deteriorating jobs with rejection on a single machine (Q953419) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← 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)
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Scheduling problems with rejection to minimize the maximum flow time (Q1691942) (← links)
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← links)
- Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions (Q1698296) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022) (← 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)
- Minimizing the makespan on a single parallel batching machine (Q2268874) (← links)
- Two-agent scheduling with rejection on a single machine (Q2337544) (← links)
- The online \(k\)-server problem with rejection (Q2339820) (← links)
- Rent or buy problems with a fixed time horizon (Q2345983) (← links)
- Online file caching with rejection penalties (Q2346958) (← links)
- Scheduling with machine cost and rejection (Q2385470) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← 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)
- Online scheduling with machine cost and rejection (Q2462392) (← 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)
- SCHEDULING DETERIORATING JOBS ON A SINGLE MACHINE WITH RELEASE TIMES AND REJECTION (Q3166735) (← links)