Pages that link to "Item:Q1411622"
From MaRDI portal
The following pages link to Preemptive scheduling with rejection (Q1411622):
Displayed 26 items.
- Semi-online scheduling on two identical machines with rejection (Q385491) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Optimal semi-online algorithm for scheduling with rejection on two uniform machines (Q411229) (← links)
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties (Q437059) (← links)
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times (Q456108) (← links)
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← 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)
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← 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)
- Single machine scheduling with release dates and rejection (Q1042081) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
- Minimizing the makespan on a single parallel batching machine (Q2268874) (← links)
- Scheduling with machine cost and rejection (Q2385470) (← 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)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Single Machine Scheduling with an Availability Constraint and Rejection (Q2931173) (← links)
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection (Q3541120) (← links)
- Scheduling deteriorating jobs with rejection on dominant machines (Q3640924) (← links)
- TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION (Q5411726) (← links)