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