Pages that link to "Item:Q5668251"

The following pages link to Variance Minimization in Single Machine Sequencing Problems (Q5668251):

Displaying 50 items.

• Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
• Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized (Q360482) (← links)
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties (Q534918) (← links)
• Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← links)
• Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties (Q548379) (← 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)
• Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
• Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
• Job scheduling methods for reducing waiting time variance (Q878584) (← links)
• Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
• Scheduling jobs on a single machine to maximize the total revenue of jobs (Q954056) (← links)
• Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
• Proof of a conjecture of Schrage about the completion time variance problem (Q1183389) (← links)
• Single machine scheduling with coefficient of variation minimization (Q1205688) (← links)
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198) (← links)
• Scheduling about a given common due date to minimize mean squared deviation of completion times (Q1266598) (← 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)
• Bounds for the position of the smallest job in completion time variance minimization (Q1296376) (← links)
• Minimizing flow time variance in a single machine system using genetic algorithms (Q1310012) (← links)
• Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
• A solvable case of the variance minimization problem (Q1324501) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• A quadratic integer programming method for minimizing the mean squared deviation of completion times (Q1342085) (← links)
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
• Multi-machine scheduling with variance minimization (Q1392562) (← links)
• A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← 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)
• Scheduling deteriorating jobs with a learning effect on unrelated parallel machines (Q1634126) (← links)
• Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
• The single machine weighted mean squared deviation problem (Q1753598) (← links)
• An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
• Minimizing completion time variance with compressible processing times (Q1781972) (← links)
• New results on the completion time variance minimization (Q1805454) (← links)
• Processing-plus-wait due dates in single-machine scheduling (Q1893346) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
• An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
• An exact algorithm to minimize mean squared deviation of job completion times about a common due date (Q2356179) (← links)
• Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times (Q2462556) (← links)
• A note on lower bound for completion time variance in single machine scheduling. (Q2468562) (← links)
• A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)