Combinatorial technique for short term scheduling of multipurpose batch plants based on schedule-graph representation

Sanmartí, Eduard; Friedler, Ferenc; Puigjaner, Luís

doi:10.1016/s0098-1354(98)00163-x

Cited by 29 publications

(9 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Sanmarti et al use a graph representation called the S-Graph for specifying specific chemical processes in multipurpose batch plants [13,14]. Their approach demonstrates how graphs are well suited for modelling complex scenarios as in this case they model a flexible environment where the number of products is very large and where alternative paths may be used to manufacture the same product.…”

Section: Production Line Graph Modellingmentioning

confidence: 99%

Manufacturing Production Line Modelling and Classification of Associated NP-Hard Problems

Bonello¹,

Abela²,

Cachia³

2018

Int J Comput Softw Eng

View full text Add to dashboard Cite

The purpose and scope of this studyThis study was part of a two-year research project financed by the European Regional Development Fund (ERDF) called Research Services in Manufacturing: ICT in Manufacturing. The objective of this process was to create a software solution that allows operators to model production lines and determine and classify the scheduling problems represented by the model. It has long been felt that not enough information is available regarding the scheduling problems affecting the manufacturing industry in Malta. This project was undertaken to gain additional information on the state of scheduling in the local manufacturing industry and to provide an extensible framework that can be used for current analysis and future research.This study focused on providing a graphical means of representing scheduling problems. This representation describes the abstraction of the production line involved in manufacturing a product. The second aim of the study is to create a set of heuristics using the model to classify the scheduling problem according to its computational complexity, and when possible, pointing to the relevant literature used to derive the classification in order to help researchers understand the problem better.Scheduling involves efficient utilisation of scarce resources. While this study focuses on scheduling in manufacturing industry, Leung draws a parallel to the problems encountered by computer scientists in the 1960s when computational resources (CPU, memory and I/O devices) were scarce [8]. This results of this study are of interest to computer scientists, operators in the manufacturing industry whose work deals with scheduling and to researchers in the field of optimisation. AbstractOptimisation of production lines is known to be NP-Hard in the general case so many near-optimal approximation algorithms have been researched to overcome the challenge [1]. In this paper we describe an approach to modelling production lines using a graph theoretic model. In particular, we focus on single machine and job shop problems. We show that the model can be extended to open shop problems. We also discuss how the model can be used to classify scheduling problems from the generated models. Int J Comput Softw EngIJCSE, an open access journal

show abstract

Section: Production Line Graph Modellingmentioning

confidence: 99%

Manufacturing Production Line Modelling and Classification of Associated NP-Hard Problems

Bonello¹,

Abela²,

Cachia³

2018

Int J Comput Softw Eng

View full text Add to dashboard Cite

show abstract

“…The S-graph framework consists of the representation of the scheduling problem [14], the basic algorithm [1], and the acceleration tools. This section summarizes the S-graph representation and the basic algorithm.…”

Section: S-graph Framework For Schedulingmentioning

confidence: 99%

Effective scheduling of a large-scale paint production system

Adonyi

Biros

Holczinger

et al. 2008

Journal of Cleaner Production

View full text Add to dashboard Cite

“…Sanmarti ́et al 19 developed the graphical S-graph approach to schedule batch operation without the use of time points; however, it is limited to no intermediate storage (NIS) and UIS policies.…”

Section: Introductionmentioning

confidence: 99%

Introducing the Concept of Roving Pumps in the Synthesis of Multipurpose Batch Plants

Engelbrecht

Majozi

2018

Ind. Eng. Chem. Res.

View full text Add to dashboard Cite

Presented in this article is a novel technique for the exploitation of a unique feature of multipurpose batch plants, so-called Roving pumps. The discretized nature of batch processes allows for the allocation of pumps to different units and tasks depending on pump availability over the time horizon of interest. A MILP formulation is proposed to determine the optimal number and allocation of pumps within the batch plant while simultaneously synthesizing the plant and optimizing the production schedule with variable material transfer times. It is shown by way of an example that it is possible to decrease the number of pumps required for operation from seven to two pumps, while another example demonstrates a decrease in the number of pumps required from eleven to three. It is, therefore, possible to reduce capital and maintenance costs by implementing the formulation while still achieving or improving on existing throughputs.

show abstract

Combinatorial technique for short term scheduling of multipurpose batch plants based on schedule-graph representation

Cited by 29 publications

References 3 publications

Manufacturing Production Line Modelling and Classification of Associated NP-Hard Problems

Manufacturing Production Line Modelling and Classification of Associated NP-Hard Problems

Effective scheduling of a large-scale paint production system

Introducing the Concept of Roving Pumps in the Synthesis of Multipurpose Batch Plants

Contact Info

Product

Resources

About