A branch and price algorithm for single-machine completion time variance
type: Item
instance of: scholarly article
title: A branch and price algorithm for single-machine completion time variance
zbMATH Open document ID: 1458.90367
author: Shijin Wang
author: Ying Lu
published in: Computers \& Operations Research
publication date: 2019-07-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7077672
zbMATH Keywords: scheduling
zbMATH Keywords: branch and price
zbMATH Keywords: single machine
zbMATH Keywords: completion time variance
zbMATH Keywords: mixed integer programming
MaRDI profile type: Publication
full work available at URL: j.cor.2019.05.007
OpenAlex ID: W2944250118
cites work: Tabu search for a class of single-machine scheduling problems
cites work: Multi-machine scheduling with variance minimization
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: Solving Parallel Machine Scheduling Problems by Column Generation
cites work: Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension
cites work: Minimising Waiting Time Variance in the Single Machine Problem
cites work: Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
cites work: Hierarchical minimization of completion time variance and makespan in jobshops
cites work: Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Minimizing the Flow-time Variance in Single-machine Systems
cites work: Minimizing Variation of Flow Time in Single Machine Systems
cites work: Completion time variance minimization on a single machine is difficult
cites work: New results on the completion time variance minimization
cites work: Fast fully polynomial approximation schemes for minimizing completion time variance
cites work: Q4821818
cites work: Bounds for the position of the smallest job in completion time variance minimization
cites work: A column generation approach for the unconstrained binary quadratic programming problem
cites work: An efficient local search for minimizing completion time variance in permutation flow shops
cites work: Variance Minimization in Single Machine Sequencing Problems
cites work: A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
cites work: A lower bound for weighted completion time variance
cites work: The single machine weighted mean squared deviation problem
cites work: Scheduling
cites work: Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
cites work: Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
cites work: Minimizing the Time-in-System Variance for a Finite Jobset
cites work: Permutation polyhedra and minimisation of the variance of completion times on a single machine
cites work: Completion time variance minimisation on two identical parallel processors
cites work: Completion time variance minimization in single machine and multi-machine systems
cites work: Decomposition methods for the parallel machine scheduling problem with setups
cites work: Deterministic and Random Single Machine Sequencing with Variance Minimization
cites work: Minimizing Single-Machine Completion Time Variance
cites work: A branch and bound algorithm to minimize completion time variance on a single processor.
cites work: A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION
DOI: 10.1016/J.COR.2019.05.007
Recommended article: A branch and bound algorithm to minimize completion time variance on a single processor.
Recommended article: Completion time variance minimization in single machine and multi-machine systems
Recommended article: A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
Recommended article: A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
Recommended article: A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
Recommended article: An almost exact solution to the min completion time variance in a single machine
Recommended article: Minimizing Single-Machine Completion Time Variance
Recommended article: Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
Recommended article: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
description: scientific article; zbMATH DE number 7077672