Pages that link to "Item:Q2168731"

The following pages link to Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties (Q2168731):

Displaying 9 items.

• Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
• Exact and approximate methods for parallel multiple-area spatial scheduling with release times (Q2393121) (← links)
• A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
• On Submodular Search and Machine Scheduling (Q5108249) (← links)
• Algorithms for single machine scheduling problem with release dates and submodular penalties (Q6039534) (← links)
• Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)
• An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties (Q6566793) (← links)
• The prize-collecting single machine scheduling with bounds and penalties (Q6621854) (← links)
• \(W\)-prize-collecting scheduling problem on parallel machines (Q6646746) (← links)