Minimizing Variation of Flow Time in Single Machine Systems
From MaRDI portal
Publication:3929531
DOI10.1287/mnsc.27.12.1453zbMath0473.90048OpenAlexW2032431912MaRDI QIDQ3929531
Publication date: 1981
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.27.12.1453
single machineoptimal solutionheuristic methodn jobsminimal flow time variationseveral variation measures
Related Items
The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ A quadratic integer programming method for minimizing the mean squared deviation of completion times ⋮ Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects ⋮ Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times ⋮ Scheduling deteriorating jobs with a learning effect on unrelated parallel machines ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Processing-plus-wait due dates in single-machine scheduling ⋮ Single machine scheduling with past-sequence-dependent setup times and learning effects ⋮ Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ A note on resource allocation scheduling with position-dependent workloads ⋮ Job sequencing and due date assignment in a single machine shop with uncertain processing times ⋮ Single machine scheduling problems with controllable processing times and total absolute differences penalties ⋮ Completion time variance minimisation on two identical parallel processors ⋮ Pseudopolynomial algorithms for CTV minimization in single machine scheduling ⋮ Parallel-machine scheduling with non-simultaneous machine available time ⋮ Job scheduling methods for reducing waiting time variance ⋮ Mimimization of agreeably weighted variance in single machine systems ⋮ Total absolute deviation of job completion times on uniform and unrelated machines ⋮ Single-machine scheduling problems with both deteriorating jobs and learning effects ⋮ Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration ⋮ A lower bound for weighted completion time variance ⋮ Multi-machine scheduling with variance minimization ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ Time-flexible min completion time variance in a single machine by quadratic programming ⋮ Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times ⋮ Optimization of scheduling problems with deterioration effects and an optional maintenance activity ⋮ Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration ⋮ Resource dependent scheduling with truncated learning effects ⋮ Single-machine scheduling with time-and-resource-dependent processing times ⋮ A bicriteria approach to scheduling a single machine with job rejection and positional penalties ⋮ A branch and bound algorithm to minimize completion time variance on a single processor. ⋮ New results on single-machine scheduling with past-sequence-dependent delivery times ⋮ Considerations of single-machine scheduling with deteriorating jobs ⋮ Parallel machines scheduling with deteriorating and learning effects ⋮ Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time ⋮ Single machine scheduling with truncated job-dependent learning effect ⋮ A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection ⋮ Proof of a conjecture of Schrage about the completion time variance problem ⋮ Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times ⋮ Single-machine scheduling problems with past-sequence-dependent setup times ⋮ An almost exact solution to the min completion time variance in a single machine ⋮ A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ Resource constrained scheduling with general truncated job-dependent learning effect ⋮ Scheduling jobs on a single machine to maximize the total revenue of jobs ⋮ SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE ⋮ Minimizing mean squared deviation of completion times with maximum tardiness constraint ⋮ Single-machine scheduling with nonlinear deterioration ⋮ Single machine scheduling with coefficient of variation minimization ⋮ Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties ⋮ Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects ⋮ Single-machine total completion time scheduling with a time-dependent deterioration ⋮ A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions ⋮ A branch and price algorithm for single-machine completion time variance ⋮ Single-machine makespan minimization scheduling with nonlinear shortening processing times ⋮ An efficient local search for minimizing completion time variance in permutation flow shops ⋮ Minimizing weighted mean absolute deviation of job completion times from their weighted mean ⋮ Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties ⋮ Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date ⋮ A half-product based approximation scheme for agreeably weighted completion time variance ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ Single-machine scheduling with both deterioration and learning effects ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Scheduling jobs with position and sum-of-processing-time based processing times ⋮ Single machine scheduling with sum-of-logarithm-processing-times based deterioration ⋮ Algorithms for minclique scheduling problems ⋮ Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect ⋮ Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times ⋮ Completion time variance minimization in single machine and multi-machine systems ⋮ New results on the completion time variance minimization ⋮ Scheduling about a given common due date to minimize mean squared deviation of completion times ⋮ Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method ⋮ A tight lower bound for the completion time variance problem ⋮ \(V\)-shape property for job sequences that minimize the expected completion time variance ⋮ Sequencing heuristic for bicriteria scheduling in a single machine problem ⋮ Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs ⋮ Bounds for the position of the smallest job in completion time variance minimization ⋮ Resource allocation scheduling with deteriorating jobs and position-dependent workloads ⋮ Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection ⋮ Minimizing flow time variance in a single machine system using genetic algorithms ⋮ Fast fully polynomial approximation schemes for minimizing completion time variance ⋮ Completion time variance minimization on a single machine is difficult ⋮ Scheduling problems with effects of deterioration and truncated job-dependent learning ⋮ An exact algorithm to minimize mean squared deviation of job completion times about a common due date
