Back to search

West Virginia University

Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method

Abstract

dc:description.abstract

In the pharmaceutical manufacturing world, a deadline could be the difference between losing a multimillion-dollar contract or extending it. This, among many other reasons, is why good scheduling methods are vital. This problem report addresses Flexible Flowshop (FF) scheduling using Simulated Annealing (SA) in conjunction with the Steepest Descent heuristic (SD). FF is a generalized version of the flowshop problem, where each product goes through S number of stages, where each stage has M number of machines. As opposed to a normal flowshop problem, all ‘jobs’ do not have to flow in the same sequence from stage to stage. The SA metaheuristic is a global optimization method for solving hard combinatorial optimization problems. SD is a local search method that keeps track only of the current solution and moves only to neighboring permutations based on the largest decrease in the objective function value. The goal of this problem report is to use FF in conjunction with SA to minimize the makespan (length of schedule) in a pharmaceutical manufacturing environment. There are 4 total stages in the tentative production route: granulation, compression, coating, and packaging. This process will be uniform; as in, each stage will have the same number of identical machines. In this study, SA solved the illustrative small-scale example problems precisely and efficiently using a very small amount of computation time. Afterward, the SD heuristic is used to ensure that the best solution found by SA is a local optimum. SD did not improve upon the solutions found by SA.

Degree

thesis:*
Name thesis:degree_name
MS
Level thesis:degree_level
Problem/Project Report
Discipline thesis:degree_discipline
Industrial and Managements Systems Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Spencer, Bryant Jamison

Subjects

dc:subject × 9

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
West Virginia University
Base URL
researchrepository.wvu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Spencer, Bryant Jamison. Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method. Problem/Project Report thesis, https://doi.org/10.33915/etd.3796