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

DOI10.1016/J.COR.2011.06.020zbMATH Open1251.90169OpenAlexW2017996247MaRDI QIDQ1762072FDOQ1762072

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

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

zbMATH Keywords

local searchdominanceflow shopcompletion time variancetabu moves

Mathematics Subject Classification ID

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

Cites Work

• A survey of the state-of-the-art of common due date assignment and scheduling research
• Benchmarks for basic scheduling problems
• Minimizing Single-Machine Completion Time Variance
• Tabu search for a class of single-machine scheduling problems
• Sequencing with Earliness and Tardiness Penalties: A Review
• Completion time variance minimization on a single machine is difficult
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Title not available (Why is that?)
• 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
• Permutation flow shop scheduling with earliness and tardiness penalties
• Proof of a conjecture of Schrage about the completion time variance problem
• 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 Variation of Flow Time in Single Machine Systems
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Permutation polyhedra and minimisation of the variance of completion times on a single machine

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)