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

Authors:
Peeyush Mehta;Pushkar Pandit;Deepu Philip;Prabha Sharma
Affiliations:
Industrial & Management Engineering Department, IIT Kanpur, Kanpur, Uttar Pradesh 208016, India;Telco Construction Equipment Company (Telcon), 45 Museum Road, Bangalore 560025, India;Industrial & Management Engineering Department, IIT Kanpur, Kanpur, Uttar Pradesh 208016, India;Department of Mathematics & Statistics, IIT Kanpur, Kanpur, Uttar Pradesh 208016, India
Venue:
Computers and Operations Research
Year:
2012

Citing 9
Cited 0

Minimizing mean squared deviation of completion times about a common due date

Management Science
Deterministic and random single machine sequencing with variance minimization

Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Minimizing single-machine completion time variance

Management Science
Tabu search for a class of single-machine scheduling problems

Computers and Operations Research
Permutation Polyhedra and Minimisation of the Variance of Completion Times on a Single Machine

Journal of Heuristics
A branch and bound algorithm to minimize completion time variance on a single processor

Computers and Operations Research
Completion time variance minimization on a single machine is difficult

Operations Research Letters
Proof of a conjecture of Schrage about the completion time variance problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper illustrates that by exploiting the structure of hard combinatorial optimization problems, efficient local search schemes can be designed that guarantee performance in solution quality and computational time. A two-phase local search algorithm is developed and applied to the permutation flow shop scheduling problem, with the objective of minimizing the completion time variance. New and significant analytical insights necessary for effectively solving the permutation flow shop problem are also presented and used in this research. Computational results indicate that for test problems, the local search obtained optimal solutions for many instances, within few seconds of CPU time. For other benchmark problems with jobs between 50 and 100, the proposed algorithm, ADJ-Reduced improved the existing best known values within a practical time frame.