Maximization of throughput over a fixed time horizon using a recently developed S-graph approach: A pharmaceuticals case study

T. Majozi, T. Holczinger, R. Adonyi, F. Friedler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents the application of a recently developed graph-theoretic approach for scheduling of multipurpose batch plants with the objective to maximize economic performance indices, like throughput, revenue and profit over a predefined time horizon. The approach is based on an S-graph framework which has been previously applied in scheduling of multipurpose batch plants for the optimization of time based performance indices, e.g. minimization of makespan. Most of scheduling techniques published in literature are based on mixed integer linear programming (MILP) and mixed integer nonlinear programming (MINLP) in which presupposition of the number of time points or discretization of the time horizon of interest has become traditional. In contrast, the approach proposed in this paper does not require any presupposition of the number of time points nor manipulation of the time horizon of interest. This particular feature renders the presented technique continuous in time. The optimization procedure is based on a branch and bound (B&B) algorithm which is guaranteed to terminate at a global optimum. The further advantage of the proposed approach is that the structural uniqueness of the problem can be readily exploited to improve computational efficiency, thereby rendering the approach amenable to industrial scale and structurally complex problems. Only the non-intermediate storage (NIS) operational policy is addressed in this paper. The problem addressed in this paper can be stated as follows. Given, (i) the production recipe for each product, (ii) the allocation of tasks to each equipment unit, (iii) relevant cost data and (iv) the time horizon of interest, determine the schedule that yields the overall maximum throughput for all the products involved. It is worthy of note that the objective function need not necessarily be maximization of throughput, but can assume other forms like maximization of profit or revenue. In all the problems considered in this paper there exists no intermediate storage (NIS) between consecutive tasks. However, the material can be temporarily stored within the corresponding processing equipment unit until the consecutive equipment unit is available for the next task in the recipe. The equipment units are assumed to be of equal capacities for the same task. Moreover, the amount of material processed within each equipment unit is assumed fixed for various batches of different products. A pharmaceutical case study in which this approach has been applied is presented.

Original languageEnglish
Title of host publicationCHISA 2006 - 17th International Congress of Chemical and Process Engineering
Publication statusPublished - 2006
EventCHISA 2006 - 17th International Congress of Chemical and Process Engineering - Prague, Czech Republic
Duration: Aug 27 2006Aug 31 2006

Other

OtherCHISA 2006 - 17th International Congress of Chemical and Process Engineering
CountryCzech Republic
CityPrague
Period8/27/068/31/06

Fingerprint

Drug products
Throughput
Pharmaceutical Preparations
Scheduling
Profitability
Nonlinear programming
Computational efficiency
Linear programming
Economics
Processing
Costs

ASJC Scopus subject areas

  • Chemical Engineering(all)

Cite this

Majozi, T., Holczinger, T., Adonyi, R., & Friedler, F. (2006). Maximization of throughput over a fixed time horizon using a recently developed S-graph approach: A pharmaceuticals case study. In CHISA 2006 - 17th International Congress of Chemical and Process Engineering

Maximization of throughput over a fixed time horizon using a recently developed S-graph approach : A pharmaceuticals case study. / Majozi, T.; Holczinger, T.; Adonyi, R.; Friedler, F.

CHISA 2006 - 17th International Congress of Chemical and Process Engineering. 2006.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Majozi, T, Holczinger, T, Adonyi, R & Friedler, F 2006, Maximization of throughput over a fixed time horizon using a recently developed S-graph approach: A pharmaceuticals case study. in CHISA 2006 - 17th International Congress of Chemical and Process Engineering. CHISA 2006 - 17th International Congress of Chemical and Process Engineering, Prague, Czech Republic, 8/27/06.
Majozi T, Holczinger T, Adonyi R, Friedler F. Maximization of throughput over a fixed time horizon using a recently developed S-graph approach: A pharmaceuticals case study. In CHISA 2006 - 17th International Congress of Chemical and Process Engineering. 2006
Majozi, T. ; Holczinger, T. ; Adonyi, R. ; Friedler, F. / Maximization of throughput over a fixed time horizon using a recently developed S-graph approach : A pharmaceuticals case study. CHISA 2006 - 17th International Congress of Chemical and Process Engineering. 2006.
@inproceedings{d7a326bba97e4f988945ee7f8647d13a,
title = "Maximization of throughput over a fixed time horizon using a recently developed S-graph approach: A pharmaceuticals case study",
abstract = "This paper presents the application of a recently developed graph-theoretic approach for scheduling of multipurpose batch plants with the objective to maximize economic performance indices, like throughput, revenue and profit over a predefined time horizon. The approach is based on an S-graph framework which has been previously applied in scheduling of multipurpose batch plants for the optimization of time based performance indices, e.g. minimization of makespan. Most of scheduling techniques published in literature are based on mixed integer linear programming (MILP) and mixed integer nonlinear programming (MINLP) in which presupposition of the number of time points or discretization of the time horizon of interest has become traditional. In contrast, the approach proposed in this paper does not require any presupposition of the number of time points nor manipulation of the time horizon of interest. This particular feature renders the presented technique continuous in time. The optimization procedure is based on a branch and bound (B&B) algorithm which is guaranteed to terminate at a global optimum. The further advantage of the proposed approach is that the structural uniqueness of the problem can be readily exploited to improve computational efficiency, thereby rendering the approach amenable to industrial scale and structurally complex problems. Only the non-intermediate storage (NIS) operational policy is addressed in this paper. The problem addressed in this paper can be stated as follows. Given, (i) the production recipe for each product, (ii) the allocation of tasks to each equipment unit, (iii) relevant cost data and (iv) the time horizon of interest, determine the schedule that yields the overall maximum throughput for all the products involved. It is worthy of note that the objective function need not necessarily be maximization of throughput, but can assume other forms like maximization of profit or revenue. In all the problems considered in this paper there exists no intermediate storage (NIS) between consecutive tasks. However, the material can be temporarily stored within the corresponding processing equipment unit until the consecutive equipment unit is available for the next task in the recipe. The equipment units are assumed to be of equal capacities for the same task. Moreover, the amount of material processed within each equipment unit is assumed fixed for various batches of different products. A pharmaceutical case study in which this approach has been applied is presented.",
author = "T. Majozi and T. Holczinger and R. Adonyi and F. Friedler",
year = "2006",
language = "English",
isbn = "8086059456",
booktitle = "CHISA 2006 - 17th International Congress of Chemical and Process Engineering",

}

TY - GEN

T1 - Maximization of throughput over a fixed time horizon using a recently developed S-graph approach

T2 - A pharmaceuticals case study

AU - Majozi, T.

AU - Holczinger, T.

AU - Adonyi, R.

AU - Friedler, F.

PY - 2006

Y1 - 2006

N2 - This paper presents the application of a recently developed graph-theoretic approach for scheduling of multipurpose batch plants with the objective to maximize economic performance indices, like throughput, revenue and profit over a predefined time horizon. The approach is based on an S-graph framework which has been previously applied in scheduling of multipurpose batch plants for the optimization of time based performance indices, e.g. minimization of makespan. Most of scheduling techniques published in literature are based on mixed integer linear programming (MILP) and mixed integer nonlinear programming (MINLP) in which presupposition of the number of time points or discretization of the time horizon of interest has become traditional. In contrast, the approach proposed in this paper does not require any presupposition of the number of time points nor manipulation of the time horizon of interest. This particular feature renders the presented technique continuous in time. The optimization procedure is based on a branch and bound (B&B) algorithm which is guaranteed to terminate at a global optimum. The further advantage of the proposed approach is that the structural uniqueness of the problem can be readily exploited to improve computational efficiency, thereby rendering the approach amenable to industrial scale and structurally complex problems. Only the non-intermediate storage (NIS) operational policy is addressed in this paper. The problem addressed in this paper can be stated as follows. Given, (i) the production recipe for each product, (ii) the allocation of tasks to each equipment unit, (iii) relevant cost data and (iv) the time horizon of interest, determine the schedule that yields the overall maximum throughput for all the products involved. It is worthy of note that the objective function need not necessarily be maximization of throughput, but can assume other forms like maximization of profit or revenue. In all the problems considered in this paper there exists no intermediate storage (NIS) between consecutive tasks. However, the material can be temporarily stored within the corresponding processing equipment unit until the consecutive equipment unit is available for the next task in the recipe. The equipment units are assumed to be of equal capacities for the same task. Moreover, the amount of material processed within each equipment unit is assumed fixed for various batches of different products. A pharmaceutical case study in which this approach has been applied is presented.

AB - This paper presents the application of a recently developed graph-theoretic approach for scheduling of multipurpose batch plants with the objective to maximize economic performance indices, like throughput, revenue and profit over a predefined time horizon. The approach is based on an S-graph framework which has been previously applied in scheduling of multipurpose batch plants for the optimization of time based performance indices, e.g. minimization of makespan. Most of scheduling techniques published in literature are based on mixed integer linear programming (MILP) and mixed integer nonlinear programming (MINLP) in which presupposition of the number of time points or discretization of the time horizon of interest has become traditional. In contrast, the approach proposed in this paper does not require any presupposition of the number of time points nor manipulation of the time horizon of interest. This particular feature renders the presented technique continuous in time. The optimization procedure is based on a branch and bound (B&B) algorithm which is guaranteed to terminate at a global optimum. The further advantage of the proposed approach is that the structural uniqueness of the problem can be readily exploited to improve computational efficiency, thereby rendering the approach amenable to industrial scale and structurally complex problems. Only the non-intermediate storage (NIS) operational policy is addressed in this paper. The problem addressed in this paper can be stated as follows. Given, (i) the production recipe for each product, (ii) the allocation of tasks to each equipment unit, (iii) relevant cost data and (iv) the time horizon of interest, determine the schedule that yields the overall maximum throughput for all the products involved. It is worthy of note that the objective function need not necessarily be maximization of throughput, but can assume other forms like maximization of profit or revenue. In all the problems considered in this paper there exists no intermediate storage (NIS) between consecutive tasks. However, the material can be temporarily stored within the corresponding processing equipment unit until the consecutive equipment unit is available for the next task in the recipe. The equipment units are assumed to be of equal capacities for the same task. Moreover, the amount of material processed within each equipment unit is assumed fixed for various batches of different products. A pharmaceutical case study in which this approach has been applied is presented.

UR - http://www.scopus.com/inward/record.url?scp=34748870133&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34748870133&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:34748870133

SN - 8086059456

SN - 9788086059457

BT - CHISA 2006 - 17th International Congress of Chemical and Process Engineering

ER -