Pages that link to "Item:Q897945"

The following pages link to Penalty cost constrained identical parallel machine scheduling problem (Q897945):

Displaying 16 items.

• Order acceptance and scheduling with consideration of service level (Q513576) (← links)
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection (Q681293) (← links)
• Bicriteria order acceptance and scheduling with consideration of fill rate (Q1683125) (← links)
• Vector scheduling with rejection on a single machine (Q1743644) (← links)
• Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
• Parallel machine scheduling with restricted job rejection (Q2399612) (← links)
• Vector scheduling with rejection on two machines (Q5031186) (← links)
• Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates (Q5216801) (← links)
• Algorithms for single machine scheduling problem with release dates and submodular penalties (Q6039534) (← links)
• Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties (Q6046629) (← links)
• On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan (Q6535285) (← links)
• Bag-of-tasks scheduling with rejection in large computing systems (Q6542877) (← links)
• Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing (Q6556087) (← links)
• The prize-collecting single machine scheduling with bounds and penalties (Q6621854) (← links)
• Minimizing the maximum lateness for scheduling with release times and job rejection (Q6646743) (← links)
• \(W\)-prize-collecting scheduling problem on parallel machines (Q6646746) (← links)