Abstract
In highly regulated industries, such as agrochemical and pharmaceutical, new products have to pass a number of regulatory tests related to safety, efficacy and environmental impact, to gain FDA approval. If a product fails one of these tests it cannot enter the market place and the investment in previous tests is wasted. Depending on the nature of the products, testing may last up to 10 years, and the scheduling of the tests should be made with the goal of minimizing the time to market and the cost of testing. Maravelias and Grossmann (2001) proposed a mixed-integer linear program (MILP) that considers a set of candidate products for which the cost, duration and probability of success of their tests is given, as well as the potential income if the products are successfully launched. Furthermore, there are limited resources in terms of laboratories and number of technicians. If needed, a test may be outsourced at a higher cost. The major decisions in the model are: (i) the decision to perform in-house or outsource a testing task, (ii) the assignment of resources to testing tasks, and (iii) the sequencing and timing of tests. The objective is to maximize the net present value of multiple projects. The mixed-integer linear program can become very expensive for solving real world problems (2–10 products and 50–200 tests). In order to improve the linear programming relaxation, we propose the use of logic cuts that are derived from implied precedences that arise in the graphs of the corresponding schedules. The solution of a single large-scale problem is avoided with a heuristic decomposition algorithm that relies on solving a reduced MILP model that embeds the optimal schedules obtained for the individual products. It is shown that a tight upper bound can be easily determined for this decomposition algorithm. On a set of test problems the proposed algorithm is shown to be one to two orders of magnitude faster than the full space method, yielding solutions that are optimal or near optimal.
Author to whom correspondence should be addressed
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K.; Magnanti, T.L.; Orlin, J.B. Network Flows: Theory, Algorithms and Applications, Prentice Hall, 1993.
Honkomp, S.J.; Reklaitis, G.V.; Pekny, G.F. Robust Planning and Scheduling of Process Development Projects under Stochastic Conditions. AIChE Annual Meeting, Los Angeles, CA, 1997.
Hooker, J.N.; Yan, H.; Grossmann, I.E.; Raman, R. Logic Cuts for Processing Networks with Fixed Charges, Computers and Operations Research, 1994, 21(3), 265–279.
Jain, V; Grossmann, I. E. Resource-constrained Scheduling of Tests in New Product Development. Ind. Eng. Chem. Res., 1999, 38, 3013–3026.
Johnson E.L.; Nemhauser, G.L.; Savelsbergh, M.W.P.; Progress in Linear Programming Based Branch-and-Bound Algorithms: Exposition, INFORMS Journal of Computing, 2000 (12).
Maravelias, C; Grossmann, I.E. Simultaneous Planning for New Product Development and Batch Manufacturing Facilities. Ind. Eng. Chem. Res., 2001, 40, 6147–6164.
Maravelias, C.T.; Grossmann, I.E. Optimal Resource Investment and Scheduling of Tests for New Product Development. To appear in Computers and Chemical Engineering.
Robbins-Roth, C. From Alchemy to IPO: The Business of Biotechnology, Perseus Books, 2001
Schmidt, C.W.; Grossmann, I.E. Optimization Models for the Scheduling of Testing Tasks in New Product Development. Ind. Eng. Chem. Res., 1996, 35, 3498–3510.
Schmidt, C. W.; Grossmann, I. E.; Blau, G. E. Optimization of Industrial Scale Scheduling Problems in New Product Development. Computers Chem. Engng., 1998, 22, S1027–S1030.
Subramanian, D.; Pekny, J.F.; Reklaitis, G.V. A Simulation-Optimization Framework for Research and Development Pipeline Management. Journal of AIChE. 2001, 47(10), 2226–2242.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Maravelias, C.T., Grossmann, I.E. (2006). Logic Inference and a Decomposition Algorithm for the Resource-Constrained Scheduling of Testing Tasks in the Development of New Pharmaceutical and Agrochemical Products. In: Appa, G., Pitsoulis, L., Williams, H.P. (eds) Handbook on Modelling for Discrete Optimization. International Series in Operations Research & Management Science, vol 88. Springer, Boston, MA. https://doi.org/10.1007/0-387-32942-0_9
Download citation
DOI: https://doi.org/10.1007/0-387-32942-0_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-32941-3
Online ISBN: 978-0-387-32942-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)