An efficient local search for minimizing completion time variance in permutation flow shops
From MaRDI portal
Publication:1762072
DOI10.1016/j.cor.2011.06.020zbMath1251.90169OpenAlexW2017996247MaRDI QIDQ1762072
Peeyush Mehta, Prabha Sharma, Pushkar Pandit, Deepu Philip
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.06.020
Related Items (1)
Cites Work
- Unnamed Item
- Proof of a conjecture of Schrage about the completion time variance problem
- Completion time variance minimization on a single machine is difficult
- A branch and bound algorithm to minimize completion time variance on a single processor.
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Permutation polyhedra and minimisation of the variance of completion times on a single machine
- Benchmarks for basic scheduling problems
- Permutation flow shop scheduling with earliness and tardiness penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing Variation of Flow Time in Single Machine Systems
- Minimizing the Time-in-System Variance for a Finite Jobset
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimizing Single-Machine Completion Time Variance
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- 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
- Tabu search for a class of single-machine scheduling problems
This page was built for publication: An efficient local search for minimizing completion time variance in permutation flow shops
