1998
DOI: 10.1021/ie9800703
|View full text |Cite
|
Sign up to set email alerts
|

Continuous-Time Modeling for Short-Term Scheduling of Multipurpose Pipeless Plants

Abstract: An efficient short-term scheduling, mixed integer programming model for a multipurpose pipeless plant over a continuous-time domain is addressed. In contrast to the conventional scheduling models for the pipeless plants with discrete time representation requiring a large number of 0−1 variables, the continuous-time model where each product has deterministic processing stage blocks with duration for unit allocation and each processing unit has a corresponding time slot is built. Jobshop features such as re-entr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2001
2001
2010
2010

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 29 publications
(29 citation statements)
references
References 4 publications
0
29
0
Order By: Relevance
“…4. Research contributions following this direction include those presented by Pinto and Grossmann (1994, Pinto, Ttirkay, Bolio, and Grossmann (1998), Karimi and McDonald (1997), Lamba and Karimi (2002a,b), Bok and Park (1998), Moon and Hrymak (1999).…”
Section: Sequential Processesmentioning
confidence: 99%
“…4. Research contributions following this direction include those presented by Pinto and Grossmann (1994, Pinto, Ttirkay, Bolio, and Grossmann (1998), Karimi and McDonald (1997), Lamba and Karimi (2002a,b), Bok and Park (1998), Moon and Hrymak (1999).…”
Section: Sequential Processesmentioning
confidence: 99%
“…The scheduling problems were formulated mainly with the use of the mixed integer linear programming (MILP) [5]- [7]. However, the main weakness of the MILP approach is that, as the complexity of a system increases, the scheduling problem becomes very difficult to formulate properly [8].…”
Section: Motivationmentioning
confidence: 99%
“…The scheduling problem has been formulated mainly with the use of the Mixed Integer Linear Programming, MILP [3] [4] [5]. However, a main weakness of the MILP approach is that, as the complexity of a plant increases, the scheduling problem becomes very hard to formulate properly [6].…”
Section: Previous and Related Workmentioning
confidence: 99%