Pages that link to "Item:Q964407"

The following pages link to Single-machine scheduling under the job rejection constraint (Q964407):

Displaying 35 items.

• Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
• A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
• A survey on offline scheduling with rejection (Q398830) (← links)
• Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
• Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
• Supply chain scheduling to minimize holding costs with outsourcing (Q490179) (← links)
• Order acceptance and scheduling with consideration of service level (Q513576) (← links)
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← links)
• Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
• A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
• Bicriteria order acceptance and scheduling with consideration of fill rate (Q1683125) (← links)
• Vector scheduling with rejection on a single machine (Q1743644) (← links)
• On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
• Single machine lot scheduling with optional job-rejection (Q2025088) (← links)
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← 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 classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Minsum scheduling with acceptable lead-times and optional job rejection (Q2119760) (← 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)
• A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling (Q2168763) (← links)
• Flowshop scheduling with learning effect and job rejection (Q2215196) (← links)
• Single-machine scheduling with maintenance activities and rejection (Q2218650) (← links)
• Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
• Regular scheduling measures on proportionate flowshop with job rejection (Q2307854) (← links)
• Two-agent scheduling with rejection on a single machine (Q2337544) (← links)
• Parallel machine scheduling with restricted job rejection (Q2399612) (← links)
• Single-machine scheduling with production and rejection costs to minimize the maximum earliness (Q2410087) (← links)
• Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates (Q5216801) (← links)
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms (Q6113447) (← links)
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)
• Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing (Q6556087) (← links)
• Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)