Pages that link to "Item:Q3929531"
From MaRDI portal
The following pages link to Minimizing Variation of Flow Time in Single Machine Systems (Q3929531):
Displayed 50 items.
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties (Q437059) (← links)
- New results on single-machine scheduling with past-sequence-dependent delivery times (Q441858) (← links)
- Resource constrained scheduling with general truncated job-dependent learning effect (Q511713) (← links)
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties (Q534918) (← links)
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects (Q534943) (← links)
- Single-machine total completion time scheduling with a time-dependent deterioration (Q534948) (← 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)
- Total absolute deviation of job completion times on uniform and unrelated machines (Q609815) (← links)
- Single-machine scheduling problems with both deteriorating jobs and learning effects (Q611502) (← links)
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration (Q613268) (← links)
- A lower bound for weighted completion time variance (Q613431) (← links)
- Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
- Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
- A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
- Single machine scheduling with sum-of-logarithm-processing-times based deterioration (Q726391) (← links)
- Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
- Single machine scheduling with past-sequence-dependent setup times and learning effects (Q845955) (← 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 jobs on a single machine to maximize the total revenue of jobs (Q954056) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← 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)
- Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method (Q1266599) (← 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)
- 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)
- 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)
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
- Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times (Q1634027) (← 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)
- Parallel-machine scheduling with non-simultaneous machine available time (Q1667812) (← links)
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection (Q1730596) (← links)
- Single-machine makespan minimization scheduling with nonlinear shortening processing times (Q1762019) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect (Q1792294) (← links)
- New results on the completion time variance minimization (Q1805454) (← links)
- Processing-plus-wait due dates in single-machine scheduling (Q1893346) (← links)