Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method, Bryant Jamison Spencer
Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method, Bryant Jamison Spencer
Graduate Theses, Dissertations, and Problem Reports
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 …