The following pages link to Algorithms and Data Structures (Q5900744):
Displaying 34 items.
- A survey on offline scheduling with rejection (Q398830) (← 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)
- Uniform parallel-machine scheduling with time dependent processing times (Q457550) (← links)
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← 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)
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) (← links)
- Scheduling linear deteriorating jobs with rejection on a single machine (Q953419) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
- Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
- Scheduling simple linear deteriorating jobs with rejection (Q1717817) (← links)
- Two-machine flow-shop scheduling with rejection (Q1762086) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
- New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling (Q2168763) (← links)
- Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
- Single-machine scheduling with maintenance activities and rejection (Q2218650) (← links)
- Single-machine scheduling with production and rejection costs to minimize the maximum earliness (Q2410087) (← links)
- Scheduling with rejection and non-identical job arrivals (Q2425836) (← links)
- Bin packing problems with rejection penalties and their dual problems (Q2495654) (← links)
- Scheduling with partial rejection (Q2661510) (← links)
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection (Q3541120) (← links)
- Scheduling deteriorating jobs with rejection on dominant machines (Q3640924) (← links)
- Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine (Q4978467) (← links)
- Proportionate Flow Shop Scheduling with Rejection (Q5359056) (← links)
- Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection (Q6053501) (← links)
- A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
- Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost (Q6542992) (← links)
