Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Biologically Inspired Design Of Context-Aware Smart Products, Ang Liu, Ivan Teo, Diandi Chen, Stephen Lu, Thorsten Wuest, Zhinan Zhang, Fei Tao Jan 2019

Biologically Inspired Design Of Context-Aware Smart Products, Ang Liu, Ivan Teo, Diandi Chen, Stephen Lu, Thorsten Wuest, Zhinan Zhang, Fei Tao

Faculty & Staff Scholarship

The rapid development of information and communication technologies (ICTs) and cyber–physical sys-tems (CPSs) has paved the way for the increasing popularity of smart products. Context-awareness isan important facet of product smartness. Unlike artifacts, various bio-systems are naturally characterizedby their extraordinary context-awareness. Biologically inspired design (BID) is one of the most commonlyemployed design strategies. However, few studies have examined the BID of context-aware smart prod-ucts to date. This paper presents a structured design framework to support the BID of context-awaresmart products. The meaning of context-awareness is defined from the perspective of product design.The framework is developed based on the theoretical foundations …


Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method, Bryant Jamison Spencer Jan 2019

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 …