z-logo
Premium
Capacity optimization and scheduling of a multiproduct manufacturing facility for biotech products
Author(s) -
Shaik Munawar A.,
Dhakre Ankita,
Rathore Anurag S.,
Patil Nitin
Publication year - 2014
Publication title -
biotechnology progress
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.572
H-Index - 129
eISSN - 1520-6033
pISSN - 8756-7938
DOI - 10.1002/btpr.1959
Subject(s) - scheduling (production processes) , time horizon , mathematical optimization , integer programming , computer science , algebraic number , linear programming , job shop scheduling , integer (computer science) , representation (politics) , task (project management) , software , discrete time and continuous time , operations research , mathematics , engineering , mathematical analysis , schedule , statistics , systems engineering , politics , operating system , political science , law , programming language
A general mathematical framework has been proposed in this work for scheduling of a multiproduct and multipurpose facility involving manufacturing of biotech products. The specific problem involves several batch operations occurring in multiple units involving fixed processing time, unlimited storage policy, transition times, shared units, and deterministic and fixed data in the given time horizon. The different batch operations are modeled using state‐task network representation. Two different mathematical formulations are proposed based on discrete‐ and continuous‐time representations leading to a mixed‐integer linear programming model which is solved using General Algebraic Modeling System software. A case study based on a real facility is presented to illustrate the potential and applicability of the proposed models. The continuous‐time model required less number of events and has a smaller problem size compared to the discrete‐time model. © 2014 American Institute of Chemical Engineers Biotechnol. Prog ., 30:1221–1230, 2014

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here