An Efficient Heuristic Approach to Total Flowtime Minimization in Permutation Flowshop Scheduling

Dipak Laha; Uday K. Chakraborty

doi:10.1007/s00170-007-1156-z

An Efficient Heuristic Approach to Total Flowtime Minimization in Permutation Flowshop Scheduling

Dipak Laha, Uday K. Chakraborty

University of Missouri-St. Louis

Research output: Contribution to journal › Article › peer-review

Abstract

 The problem of permutation flowshop scheduling is considered with the objective of minimizing the total
 flowtime. We present a constructive heuristic and two composite heuristics to solve the problem. The composite
 heuristics combine the simulated annealing method of Chakravarthy and Rajendran [Production Planning and
 Control 10 (1999)], the constructive heuristic of Nawaz et al. [Omega 11 (1983)] and the new heuristic. Computational analysis is carried out with the benchmark problems of Taillard [European Journal of Operational Research 64 (1993)]. The two composite heuristics produce better quality solutions than those produced by the composite heuristics of Liu and Reeves [European Journal of Operational Research 132 (2001)]. Statistical tests of significance are used to substantiate the improvement in solution quality

Original language	American English
Journal	The International Journal of Advanced Manufacturing Technology
Volume	38
DOIs	https://doi.org/10.1007/s00170-007-1156-z
State	Published - Sep 1 2008

Disciplines

Applied Mathematics
Engineering

Access to Document

10.1007/s00170-007-1156-zLicense: Unspecified

Cite this

@article{6d6edd3428bc4842a1d3d88d07c42fd3,

title = "An Efficient Heuristic Approach to Total Flowtime Minimization in Permutation Flowshop Scheduling",

abstract = " The problem of permutation flowshop scheduling is considered with the objective of minimizing the total flowtime. We present a constructive heuristic and two composite heuristics to solve the problem. The composite heuristics combine the simulated annealing method of Chakravarthy and Rajendran [Production Planning and Control 10 (1999)], the constructive heuristic of Nawaz et al. [Omega 11 (1983)] and the new heuristic. Computational analysis is carried out with the benchmark problems of Taillard [European Journal of Operational Research 64 (1993)]. The two composite heuristics produce better quality solutions than those produced by the composite heuristics of Liu and Reeves [European Journal of Operational Research 132 (2001)]. Statistical tests of significance are used to substantiate the improvement in solution quality",

author = "Dipak Laha and Chakraborty, {Uday K.}",

note = "The problem of permutation flowshop scheduling is considered with the objective of minimizing the total flowtime. We present a constructive heuristic and two composite heuristics to solve the...",

year = "2008",

month = sep,

day = "1",

doi = "10.1007/s00170-007-1156-z",

language = "American English",

volume = "38",

journal = "The International Journal of Advanced Manufacturing Technology",

}

TY - JOUR

T1 - An Efficient Heuristic Approach to Total Flowtime Minimization in Permutation Flowshop Scheduling

AU - Laha, Dipak

AU - Chakraborty, Uday K.

N1 - The problem of permutation flowshop scheduling is considered with the objective of minimizing the total flowtime. We present a constructive heuristic and two composite heuristics to solve the...

PY - 2008/9/1

Y1 - 2008/9/1

N2 - The problem of permutation flowshop scheduling is considered with the objective of minimizing the total flowtime. We present a constructive heuristic and two composite heuristics to solve the problem. The composite heuristics combine the simulated annealing method of Chakravarthy and Rajendran [Production Planning and Control 10 (1999)], the constructive heuristic of Nawaz et al. [Omega 11 (1983)] and the new heuristic. Computational analysis is carried out with the benchmark problems of Taillard [European Journal of Operational Research 64 (1993)]. The two composite heuristics produce better quality solutions than those produced by the composite heuristics of Liu and Reeves [European Journal of Operational Research 132 (2001)]. Statistical tests of significance are used to substantiate the improvement in solution quality

AB - The problem of permutation flowshop scheduling is considered with the objective of minimizing the total flowtime. We present a constructive heuristic and two composite heuristics to solve the problem. The composite heuristics combine the simulated annealing method of Chakravarthy and Rajendran [Production Planning and Control 10 (1999)], the constructive heuristic of Nawaz et al. [Omega 11 (1983)] and the new heuristic. Computational analysis is carried out with the benchmark problems of Taillard [European Journal of Operational Research 64 (1993)]. The two composite heuristics produce better quality solutions than those produced by the composite heuristics of Liu and Reeves [European Journal of Operational Research 132 (2001)]. Statistical tests of significance are used to substantiate the improvement in solution quality

UR - https://link.springer.com/content/pdf/10.1007%2Fs00170-007-1156-z.pdf

U2 - 10.1007/s00170-007-1156-z

DO - 10.1007/s00170-007-1156-z

M3 - Article

VL - 38

JO - The International Journal of Advanced Manufacturing Technology

JF - The International Journal of Advanced Manufacturing Technology

ER -

An Efficient Heuristic Approach to Total Flowtime Minimization in Permutation Flowshop Scheduling

Abstract

Disciplines

Access to Document

Other files and links

Cite this