An effective heuristic to reduce total flowtime for randomly-structured flowshop problems

Author

Arun John Abraham, St. Mary's University

First Advisor

Moras, Rafael

Second Advisor

Uhlig, Paul

Degree

Master of Science in Industrial Engineering (MSIE)

Date of Award

Summer 7-2023

Abstract

We propose a heuristic to reduce total flowtime in a six-job, four-machine permutation flowshop scheduling problem. This work contributes to the prolific research efforts reported in the permutation flowshop scheduling problem (PFSP).

The heuristic was applied to 102 randomly structured flowshop scheduling problems, with job processing times generated using an integer uniform distribution in the interval [1,100]. The results of computational experiments were deemed satisfactory after being evaluated by using the ordinal and percentile ranks of the resulting total flowtime for the six jobs.

LCSH subject

Heuristic algorithms; Workflow; Production control; Production engineering

Document Type

Thesis

Format

pdf

Medium

manuscript

Proquest Document ID

30996854

Recommended Citation

Abraham, Arun John, "An effective heuristic to reduce total flowtime for randomly-structured flowshop problems" (2023). Theses. 22.
https://commons.stmarytx.edu/theses/22

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.