2005
DOI: 10.1021/ie049514n
|View full text |Cite
|
Sign up to set email alerts
|

Design of Pipeless Chemical Batch Plants with Queueing Networks

Abstract: The problem of designing pipeless batch plants is tackled using a multiclass re-entrant queueing network model. The overall design procedure is divided into three hierarchical phases: the preliminary phase, neighbor search algorithm (NSA), and greedy mean value analysis (GMVA). In the preliminary phase, the types of products and stations, as well as the capacities of equipment items, are determined. GMVA, which is a generalization of conventional MVA, finds the optimal job constitution for the system within a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…1. This layout is based on the cyclic operations as presented in literature [25] and [26]. In this system, multiple robots are in operation, i.e., MHRs, which transport materials of products to process stations, and MPRs, which have mobility and varied equipment to conduct chemical processing tasks, such as coupling, feed, blending, separation, discharge, and cleaning operations at process stations.…”
Section: Robotic Batch Manufacturing Systemmentioning
confidence: 99%
“…1. This layout is based on the cyclic operations as presented in literature [25] and [26]. In this system, multiple robots are in operation, i.e., MHRs, which transport materials of products to process stations, and MPRs, which have mobility and varied equipment to conduct chemical processing tasks, such as coupling, feed, blending, separation, discharge, and cleaning operations at process stations.…”
Section: Robotic Batch Manufacturing Systemmentioning
confidence: 99%
“…Realff (1998a, 1998b) combine MILP with discrete event simulation to model the processing durations. Panek et al (2005) include scheduling heuristics and Yoo et al (2005) extend their MINLP by a queuing approach. Huang and Chung (2005) consider constraint satisfaction techniques to find an optimal schedule and deal with vessels that possess their own moving device.…”
Section: Routing Of Agvsmentioning
confidence: 99%
“…Huang and Chung considered the simultaneous solution of scheduling and routing using constraint-based methodology suitable for different layouts. Patsiatzis et al and Yoo et al incorporated different layout and design aspects into the scheduling problem. Zeballos and Mendez proposed a constraint-programming-based efficient search method for solving the simultaneous scheduling and routing problem.…”
Section: Introductionmentioning
confidence: 99%