2009
DOI: 10.1021/ie800124g
|View full text |Cite
|
Sign up to set email alerts
|

New Mixed Integer Linear Programming Model for Solving Scheduling Problems with Special Characteristics

Abstract: A new mixed integer linear programming (MILP) model suitable for optimizing scheduling problems typical in chemical and related industries is developed. These problems have characteristics like storage time constraints, operational connectivity restrictions, and continuous tasks with special precedence constraints. Therefore, a new MILP model is developed for handling these special scheduling problems. The numerical capability of the model is demonstrated using test problems of different complexity levels.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(14 citation statements)
references
References 22 publications
(55 reference statements)
0
14
0
Order By: Relevance
“…As is shown by Czuczai et al, the model summarized in section works fine for small-scale problems. However, the problem may become unsolvable even for medium-scale processes because of the combinatorial difficulties caused by the need of modeling the connections between units.…”
Section: Rolling Operationmentioning
confidence: 76%
See 2 more Smart Citations
“…As is shown by Czuczai et al, the model summarized in section works fine for small-scale problems. However, the problem may become unsolvable even for medium-scale processes because of the combinatorial difficulties caused by the need of modeling the connections between units.…”
Section: Rolling Operationmentioning
confidence: 76%
“…The makespan is not considered at all, i.e., the operations can take any time; the only requirement is that the ou th operation has to be finished before the deadline of order ord if the ou th operation produces product for satisfying order ord . The subproblem includes all the constraints detailed in the paper of Czuczai et al, except the two enforcing the satisfaction of the product orders and consumption of raw materials. The relaxation of the latter two constraints is necessary because there are not enough number of available operations for satisfying all the orders and consuming all the raw materials.…”
Section: Rolling Operationmentioning
confidence: 99%
See 1 more Smart Citation
“…The case study, first studied by Czuczai, Farkas, Rev, and Lelkes (2009), concerns an industrial process for beer production that is composed of 4 workstations: a draft beer tank, a filter, a bright beer tank, and a workstation with three package lines, Fig. 20.…”
Section: Problem Descriptionmentioning
confidence: 99%
“…The last column of Table 5, i.e. the work of Czuczai et al (2009) gives the description of the modelling option used to solve the case study. For all the solutions d 2 = RTN, which is not surprising at first glance.…”
Section: Case Retrievalmentioning
confidence: 99%