A branch and price algorithm for single-machine completion time variance

DOI10.1016/j.cor.2019.05.007zbMath1458.90367OpenAlexW2944250118MaRDI QIDQ2003576

Ying Lu, Shijin Wang

Publication date: 9 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.05.007

zbMATH Keywords

schedulingsingle machinemixed integer programmingbranch and pricecompletion time variance

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection

Cites Work

• Unnamed Item
• A column generation approach for the unconstrained binary quadratic programming problem
• A lower bound for weighted completion time variance
• Completion time variance minimization in single machine and multi-machine systems
• Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• Bounds for the position of the smallest job in completion time variance minimization
• Completion time variance minimization on a single machine is difficult
• Multi-machine scheduling with variance minimization
• A branch and bound algorithm to minimize completion time variance on a single processor.
• Fast fully polynomial approximation schemes for minimizing completion time variance
• Completion time variance minimisation on two identical parallel processors
• The single machine weighted mean squared deviation problem
• An efficient local search for minimizing completion time variance in permutation flow shops
• New results on the completion time variance minimization
• Permutation polyhedra and minimisation of the variance of completion times on a single machine
• Hierarchical minimization of completion time variance and makespan in jobshops
• Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
• A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION
• Minimizing Variation of Flow Time in Single Machine Systems
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• Solving Parallel Machine Scheduling Problems by Column Generation
• Minimizing Single-Machine Completion Time Variance
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing the Flow-time Variance in Single-machine Systems
• Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Variance Minimization in Single Machine Sequencing Problems
• Scheduling
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• Tabu search for a class of single-machine scheduling problems

This page was built for publication: A branch and price algorithm for single-machine completion time variance