Pages that link to "Item:Q830938"

The following pages link to Minimizing maximum delivery completion time for order scheduling with rejection (Q830938):

Displaying 8 items.

• Order acceptance and scheduling with consideration of service level (Q513576) (← links)
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment (Q709154) (← links)
• Bicriteria order acceptance and scheduling with consideration of fill rate (Q1683125) (← links)
• Single machine scheduling with rejection and generalized parameters (Q2149874) (← links)
• Single machine scheduling with rejection to minimize the weighted makespan (Q2151365) (← links)
• Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost (Q6053958) (← links)
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)
• An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties (Q6566793) (← links)