Pages that link to "Item:Q1991260"

The following pages link to On the parameterized tractability of single machine scheduling with rejection (Q1991260):

Displaying 21 items.

• Single machine lot scheduling with optional job-rejection (Q2025088) (← links)
• Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
• Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
• A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
• A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
• Single machine scheduling with rejection and generalized parameters (Q2149874) (← links)
• Single machine scheduling with rejection to minimize the weighted makespan (Q2151365) (← links)
• A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
• Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
• A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
• Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost (Q6053958) (← links)
• Fixed interval scheduling with third‐party machines (Q6065340) (← links)
• Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)
• A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
• Order acceptance and scheduling with delivery under generalized parameters (Q6179281) (← links)
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)
• Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)
• Serial batching to minimize the weighted number of tardy jobs (Q6657883) (← links)