Pages that link to "Item:Q1127158"

The following pages link to Mimimization of agreeably weighted variance in single machine systems (Q1127158):

Displaying 21 items.

• Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← links)
• A lower bound for weighted completion time variance (Q613431) (← links)
• A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
• A tight lower bound for the completion time variance problem (Q1268251) (← links)
• \(V\)-shape property for job sequences that minimize the expected completion time variance (Q1278193) (← links)
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
• Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
• Multi-machine scheduling with variance minimization (Q1392562) (← links)
• Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
• A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716) (← links)
• The single machine weighted mean squared deviation problem (Q1753598) (← links)
• Minimization of ordered, symmetric half-products (Q1763481) (← links)
• Minimizing completion time variance with compressible processing times (Q1781972) (← links)
• New results on the completion time variance minimization (Q1805454) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)