An efficient local search for minimizing completion time variance in permutation flow shops

DOI10.1016/J.COR.2011.06.020MaRDI QIDQ1762072zbMATH OpenOpenAlexFDO

Authors Peeyush Mehta, Pushkar Pandit, Deepu Philip, Prabha Sharma

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

zbMATH Keywords

local searchdominanceflow shopcompletion time variancetabu moves

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• A local search method for permutation flow shop scheduling
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• A comparison of local search methods for flow shop scheduling
• A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
• A new set of high-performing heuristics to minimise flowtime in permutation flowshops

Cites work

• scientific article; zbMATH DE number 31717 (Why is no real title available?)
• 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
• Benchmarks for basic scheduling problems
• Completion time variance minimization on a single machine is difficult
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• Minimising Waiting Time Variance in the Single Machine Problem
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing Single-Machine Completion Time Variance
• Minimizing Variation of Flow Time in Single Machine Systems
• Minimizing the Time-in-System Variance for a Finite Jobset
• Permutation flow shop scheduling with earliness and tardiness penalties
• Permutation polyhedra and minimisation of the variance of completion times on a single machine
• Proof of a conjecture of Schrage about the completion time variance problem
• Sequencing with Earliness and Tardiness Penalties: A Review
• Tabu search for a class of single-machine scheduling problems
• Variance Minimization in Single Machine Sequencing Problems

Cited in

(4)

• A local search method for permutation flow shop scheduling
• A branch and price algorithm for single-machine completion time variance
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time

This page was built for publication: An efficient local search for minimizing completion time variance in permutation flow shops

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