Skip to content

Commit 8523349

Browse files
authored
Merge branch 'main' into codex/find-and-fix-important-bug
2 parents c15e544 + 1b2ce81 commit 8523349

File tree

4 files changed

+13
-11
lines changed

4 files changed

+13
-11
lines changed

gdplib/jobshop/jobshop.py

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -17,9 +17,9 @@
1717
#
1818
# Jobshop example from http://www.gams.com/modlib/libhtml/logmip4.htm
1919
#
20-
# This model solves a jobshop scheduling, which has a set of jobs
21-
# which must be processed in sequence of stages but not all jobs
22-
# require all stages. A zero wait transfer policy is assumed between
20+
# This model solves a jobshop scheduling problem, which has a set of jobs
21+
# that must be processed in sequence of stages but not all jobs
22+
# require all stages. A zero-wait transfer policy is assumed between
2323
# stages. To obtain a feasible solution it is necessary to eliminate
2424
# all clashes between jobs. It requires that no two jobs be performed
2525
# at any stage at any time. The objective is to minimize the makespan,
@@ -75,7 +75,7 @@ def t_bounds(model, I):
7575
7676
Parameters
7777
----------
78-
model : Pyomo.Abstractmodel
78+
model : Pyomo.AbstractModel
7979
The job shop scheduling model, which has a set of jobs which must be processed in sequence of stages but not all jobs require all stages.
8080
A zero wait transfer policy is assumed between stages.
8181
I : str
@@ -102,7 +102,7 @@ def _L_filter(model, I, K, J):
102102
103103
Parameters
104104
----------
105-
model : Pyomo.Abstractmodel
105+
model : Pyomo.AbstractModel
106106
The jobshop scheduling model, which has a set of jobs which must be processed in sequence of stages but not all jobs require all stages.
107107
A zero wait transfer policy is assumed between stages.
108108
I : str
@@ -135,7 +135,7 @@ def _feas(model, I):
135135
136136
Parameters
137137
----------
138-
model : Pyomo.Abstractmodel
138+
model : Pyomo.AbstractModel
139139
The jobshop scheduling model, which has a set of jobs which must be processed in sequence of stages but not all jobs require all stages.
140140
A zero wait transfer policy is assumed between stages.
141141
I : str
@@ -202,7 +202,7 @@ def _disj(model, I, K, J):
202202
203203
Parameters
204204
----------
205-
model : Pyomo.Abstractmodel
205+
model : Pyomo.AbstractModel
206206
jobshop scheduling model, which has a set of jobs which must be processed in sequence of stages but not all jobs require all stages.
207207
I : str
208208
job index

gdplib/kaibel/kaibel_init.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -3,8 +3,8 @@
33
temperature values.
44
(written by E. Soraya Rawlings, esoraya@rwlngs.net)
55
6-
The separation of four components require a sequence of at least three distillation
7-
columns. Here, we calculate the minimum number of theoretical trays for the three
6+
The separation of four components requires a sequence of at least three distillation columns.
7+
Here, we calculate the minimum number of theoretical trays for the three
88
columns. The sequence is shown in Figure 2.
99
1010
COLUMN 1 COLUMN 2 COLUMN 3

gdplib/small_batch/gdp_small_batch.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ def build_model():
3535
----------
3636
[1] Kocis, G. R.; Grossmann, I. E. (1988). Global Optimization of Nonconvex Mixed-Integer Nonlinear Programming (MINLP) Problems in Process Synthesis. Ind. Eng. Chem. Res., 27(8), 1407-1421. https://doi.org/10.1021/ie00080a013
3737
38-
[2] Ovalle, D., Liñán, D. A., Lee, A., Gómez, J. M., Ricardez-Sandoval, L., Grossmann, I. E., & Neira, D. E. B. (2024). Logic-Based Discrete-Steepest Descent: A Solution Method for Process Synthesis Generalized Disjunctive Programs. arXiv preprint arXiv:2405.05358. https://doi.org/10.48550/arXiv.2405.05358
38+
[2] Ovalle, D., Liñán, D. A., Lee, A., Gómez, J. M., Ricardez-Sandoval, L., Grossmann, I. E., & Bernal Neira, D. E. (2024). Logic-Based Discrete-Steepest Descent: A Solution Method for Process Synthesis Generalized Disjunctive Programs. arXiv preprint arXiv:2405.05358. https://doi.org/10.48550/arXiv.2405.05358
3939
"""
4040
NK = 3
4141

requirements-dev.txt

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,9 @@
11
# Development requirements for GDPlib
2+
-r requirements.txt
3+
24
pytest>=6.0.0
35
pytest-cov>=2.10.0
46
black>=20.8b1
57
flake8>=3.8.0
68
setuptools>=64
7-
setuptools_scm[toml]>=6.2
9+
setuptools_scm[toml]>=6.2

0 commit comments

Comments
 (0)