Academic Journal

Optimal synthesis of multiproduct batch plants with cyclic scheduling and inventory considerations

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Optimal synthesis of multiproduct batch plants with cyclic scheduling and inventory considerations
Συγγραφείς: V. T. Voudouris, Ignacio E. Grossmann, Carnegie Mellon University.Engineering Design Research Center.
Έτος έκδοσης: 2018
Συλλογή: KiltHub Research from Carnegie Mellon University
Θεματικοί όροι: Chemical engineering not elsewhere classified, Electronic data processing Batch processing
Περιγραφή: "This paper addresses the problem of determining the optimal configuration and cyclic operation of batch plants in which all the products require the same processing sequence. In particular, the problem can be stated as follows. Given are demands of a number of products, as well as technical information on the processing tasks (size factors, processing times, clean-up times) which are not restricted to a zero-wait policy. Given are also cost data for investment and product inventories, a list of candidate equipment and a list of candidate storage vessels with standard sizes. The problem then consists in determining the following items: number, type and size of equipment, as well as their allocation to one or multiple tasks and possible parallel operation; location and size of intermediate storage vessels; the length of the production cycle including the sequence of production of the products; levels of product inventories. The objective is to maximize the net present value. The major complication of this design problem lies in the many trade-offs that are involved, as for instance the merging of tasks versus its impact on the schedule, and length of production cycle versus inventory levels. By using a novel representation for cyclic schedules and exact linearization schemes, it is shown that this problem can for [sic] formulated as a mixed- integer linear programming problem, and solved rigorously to global optimality. An efficient computational scheme is proposed for this purpose. Compared to the previous work by Birewar and Grossmann (1990), the proposed model provides a significant extension of the scope of the operational problem, while at the same time yielding an optimization problem that does not involve nonlinearities. Several example problems are presented to illustrate the capability of this method."
Τύπος εγγράφου: article in journal/newspaper
Γλώσσα: unknown
Relation: https://figshare.com/articles/journal_contribution/Optimal_synthesis_of_multiproduct_batch_plants_with_cyclic_scheduling_and_inventory_considerations/6467300
DOI: 10.1184/R1/6467300.v1
Διαθεσιμότητα: https://doi.org/10.1184/R1/6467300.v1
https://figshare.com/articles/journal_contribution/Optimal_synthesis_of_multiproduct_batch_plants_with_cyclic_scheduling_and_inventory_considerations/6467300
Rights: In Copyright
Αριθμός Καταχώρησης: edsbas.9495CE21
Βάση Δεδομένων: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://doi.org/10.1184/R1/6467300.v1#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.9495CE21
RelevancyScore: 802
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 802.436645507813
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Optimal synthesis of multiproduct batch plants with cyclic scheduling and inventory considerations
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22V%2E+T%2E+Voudouris%22">V. T. Voudouris</searchLink><br /><searchLink fieldCode="AR" term="%22Ignacio+E%2E+Grossmann%22">Ignacio E. Grossmann</searchLink><br /><searchLink fieldCode="AR" term="%22Carnegie+Mellon+University%2EEngineering+Design+Research+Center%2E%22">Carnegie Mellon University.Engineering Design Research Center.</searchLink>
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2018
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: KiltHub Research from Carnegie Mellon University
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Chemical+engineering+not+elsewhere+classified%22">Chemical engineering not elsewhere classified</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing+Batch+processing%22">Electronic data processing Batch processing</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: "This paper addresses the problem of determining the optimal configuration and cyclic operation of batch plants in which all the products require the same processing sequence. In particular, the problem can be stated as follows. Given are demands of a number of products, as well as technical information on the processing tasks (size factors, processing times, clean-up times) which are not restricted to a zero-wait policy. Given are also cost data for investment and product inventories, a list of candidate equipment and a list of candidate storage vessels with standard sizes. The problem then consists in determining the following items: number, type and size of equipment, as well as their allocation to one or multiple tasks and possible parallel operation; location and size of intermediate storage vessels; the length of the production cycle including the sequence of production of the products; levels of product inventories. The objective is to maximize the net present value. The major complication of this design problem lies in the many trade-offs that are involved, as for instance the merging of tasks versus its impact on the schedule, and length of production cycle versus inventory levels. By using a novel representation for cyclic schedules and exact linearization schemes, it is shown that this problem can for [sic] formulated as a mixed- integer linear programming problem, and solved rigorously to global optimality. An efficient computational scheme is proposed for this purpose. Compared to the previous work by Birewar and Grossmann (1990), the proposed model provides a significant extension of the scope of the operational problem, while at the same time yielding an optimization problem that does not involve nonlinearities. Several example problems are presented to illustrate the capability of this method."
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: article in journal/newspaper
– Name: Language
  Label: Language
  Group: Lang
  Data: unknown
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: https://figshare.com/articles/journal_contribution/Optimal_synthesis_of_multiproduct_batch_plants_with_cyclic_scheduling_and_inventory_considerations/6467300
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.1184/R1/6467300.v1
– Name: URL
  Label: Availability
  Group: URL
  Data: https://doi.org/10.1184/R1/6467300.v1<br />https://figshare.com/articles/journal_contribution/Optimal_synthesis_of_multiproduct_batch_plants_with_cyclic_scheduling_and_inventory_considerations/6467300
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: In Copyright
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.9495CE21
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.9495CE21
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1184/R1/6467300.v1
    Languages:
      – Text: unknown
    Subjects:
      – SubjectFull: Chemical engineering not elsewhere classified
        Type: general
      – SubjectFull: Electronic data processing Batch processing
        Type: general
    Titles:
      – TitleFull: Optimal synthesis of multiproduct batch plants with cyclic scheduling and inventory considerations
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: V. T. Voudouris
      – PersonEntity:
          Name:
            NameFull: Ignacio E. Grossmann
      – PersonEntity:
          Name:
            NameFull: Carnegie Mellon University.Engineering Design Research Center.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-locals
              Value: edsbas
ResultId 1