Using S-graph to address uncertainty in batch plants

José Miguel Laínez, Máté Hegyháti, F. Friedler, Luis Puigjaner

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Processes and markets uncertainties make batch plants a complex environment to manage production activities. Uncertainties may cause deviations and infeasibilities in predefined schedules; this may result in poor planning and inefficient utilization of materials. Consequently, the relevance of explicitly incorporating variability in the scheduling formulation in order to offer more efficient plans and robust decisions to changes has become recognized. This work addresses the batch plants scheduling under exogenous uncertainty. The most widely utilized approach to tackle this problem is stochastic programming; however its solution results in high computational expenses. From another standpoint S-graph, a graph-theoretic approach, has proved to be very efficient to deal with deterministic scheduling. In this work, the S-graph framework is enhanced so that stochastic scheduling problems can be handled. For this purpose, a LP model that is used as performance evaluator has been coupled with S-graph framework. One of the main advantages of the proposed approach is that the search space does not increase according to the number of scenarios considered in the problem. Finally, the potential of the proposed framework is highlighted through two illustrative examples.

Original languageEnglish
Pages (from-to)105-115
Number of pages11
JournalClean Technologies and Environmental Policy
Volume12
Issue number2
DOIs
Publication statusPublished - Apr 2010

Fingerprint

Scheduling
Stochastic programming
market
Planning
Uncertainty
planning
plan
material
decision

Keywords

  • S-graph
  • Scheduling
  • Uncertainty

ASJC Scopus subject areas

  • Environmental Chemistry
  • Environmental Engineering
  • Management, Monitoring, Policy and Law

Cite this

Using S-graph to address uncertainty in batch plants. / Laínez, José Miguel; Hegyháti, Máté; Friedler, F.; Puigjaner, Luis.

In: Clean Technologies and Environmental Policy, Vol. 12, No. 2, 04.2010, p. 105-115.

Research output: Contribution to journalArticle

Laínez, José Miguel ; Hegyháti, Máté ; Friedler, F. ; Puigjaner, Luis. / Using S-graph to address uncertainty in batch plants. In: Clean Technologies and Environmental Policy. 2010 ; Vol. 12, No. 2. pp. 105-115.
@article{cbcbfc27f7ed4f63a977fa3c254c3788,
title = "Using S-graph to address uncertainty in batch plants",
abstract = "Processes and markets uncertainties make batch plants a complex environment to manage production activities. Uncertainties may cause deviations and infeasibilities in predefined schedules; this may result in poor planning and inefficient utilization of materials. Consequently, the relevance of explicitly incorporating variability in the scheduling formulation in order to offer more efficient plans and robust decisions to changes has become recognized. This work addresses the batch plants scheduling under exogenous uncertainty. The most widely utilized approach to tackle this problem is stochastic programming; however its solution results in high computational expenses. From another standpoint S-graph, a graph-theoretic approach, has proved to be very efficient to deal with deterministic scheduling. In this work, the S-graph framework is enhanced so that stochastic scheduling problems can be handled. For this purpose, a LP model that is used as performance evaluator has been coupled with S-graph framework. One of the main advantages of the proposed approach is that the search space does not increase according to the number of scenarios considered in the problem. Finally, the potential of the proposed framework is highlighted through two illustrative examples.",
keywords = "S-graph, Scheduling, Uncertainty",
author = "La{\'i}nez, {Jos{\'e} Miguel} and M{\'a}t{\'e} Hegyh{\'a}ti and F. Friedler and Luis Puigjaner",
year = "2010",
month = "4",
doi = "10.1007/s10098-009-0240-5",
language = "English",
volume = "12",
pages = "105--115",
journal = "Clean Technologies and Environmental Policy",
issn = "1618-954X",
publisher = "Springer Verlag",
number = "2",

}

TY - JOUR

T1 - Using S-graph to address uncertainty in batch plants

AU - Laínez, José Miguel

AU - Hegyháti, Máté

AU - Friedler, F.

AU - Puigjaner, Luis

PY - 2010/4

Y1 - 2010/4

N2 - Processes and markets uncertainties make batch plants a complex environment to manage production activities. Uncertainties may cause deviations and infeasibilities in predefined schedules; this may result in poor planning and inefficient utilization of materials. Consequently, the relevance of explicitly incorporating variability in the scheduling formulation in order to offer more efficient plans and robust decisions to changes has become recognized. This work addresses the batch plants scheduling under exogenous uncertainty. The most widely utilized approach to tackle this problem is stochastic programming; however its solution results in high computational expenses. From another standpoint S-graph, a graph-theoretic approach, has proved to be very efficient to deal with deterministic scheduling. In this work, the S-graph framework is enhanced so that stochastic scheduling problems can be handled. For this purpose, a LP model that is used as performance evaluator has been coupled with S-graph framework. One of the main advantages of the proposed approach is that the search space does not increase according to the number of scenarios considered in the problem. Finally, the potential of the proposed framework is highlighted through two illustrative examples.

AB - Processes and markets uncertainties make batch plants a complex environment to manage production activities. Uncertainties may cause deviations and infeasibilities in predefined schedules; this may result in poor planning and inefficient utilization of materials. Consequently, the relevance of explicitly incorporating variability in the scheduling formulation in order to offer more efficient plans and robust decisions to changes has become recognized. This work addresses the batch plants scheduling under exogenous uncertainty. The most widely utilized approach to tackle this problem is stochastic programming; however its solution results in high computational expenses. From another standpoint S-graph, a graph-theoretic approach, has proved to be very efficient to deal with deterministic scheduling. In this work, the S-graph framework is enhanced so that stochastic scheduling problems can be handled. For this purpose, a LP model that is used as performance evaluator has been coupled with S-graph framework. One of the main advantages of the proposed approach is that the search space does not increase according to the number of scenarios considered in the problem. Finally, the potential of the proposed framework is highlighted through two illustrative examples.

KW - S-graph

KW - Scheduling

KW - Uncertainty

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

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

U2 - 10.1007/s10098-009-0240-5

DO - 10.1007/s10098-009-0240-5

M3 - Article

AN - SCOPUS:77953358642

VL - 12

SP - 105

EP - 115

JO - Clean Technologies and Environmental Policy

JF - Clean Technologies and Environmental Policy

SN - 1618-954X

IS - 2

ER -