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

DOI10.1016/J.COR.2019.05.007zbMATH Open1458.90367OpenAlexW2944250118MaRDI QIDQ2003576FDOQ2003576

Authors: Shijin Wang, Ying Lu 

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

Recommendations

• A branch and bound algorithm to minimize completion time variance on a single processor.
• Completion time variance minimization in single machine and multi-machine systems
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
• An almost exact solution to the min completion time variance in a single machine
• Minimizing Single-Machine Completion Time Variance
• Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times

zbMATH Keywords

schedulingsingle machinemixed integer programmingbranch and pricecompletion time variance

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
• A branch and bound algorithm to minimize completion time variance on a single processor.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003576)