LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study

Photo by sevcovic23 from unsplash

ABSTRACT In this article, the impact of preventive maintenance policies on the constructive heuristics performance for the no-wait flow-shop problem with total flow-time minimization is evaluated. The main constructive heuristics… Click to show full abstract

ABSTRACT In this article, the impact of preventive maintenance policies on the constructive heuristics performance for the no-wait flow-shop problem with total flow-time minimization is evaluated. The main constructive heuristics for the m-machine no-wait flow-shop scheduling problem with total flow-time minimization are compared through computational experiments with a set of 5760 problems. The results show that the adopted parameters significantly affect the performance of the constructive heuristics; also, the computational effort required to solve the problems increases owing to the complexity of the function-objective calculation. Heuristics proposed by Laha and Sapkal (LSH) and Framinan, Nagano and Moccellin (FNMH) provide the best solutions for both evaluated policies.

Keywords: flow shop; total flow; wait flow; flow time; problem total; flow

Journal Title: Engineering Optimization
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.