diff --git a/notebooks/03/05-machine-scheduling.ipynb b/notebooks/03/05-machine-scheduling.ipynb
index 2f5f1339..240ecc0d 100644
--- a/notebooks/03/05-machine-scheduling.ipynb
+++ b/notebooks/03/05-machine-scheduling.ipynb
@@ -76,7 +76,7 @@
     "\n",
     "\"Which job should be done next?\" is a question one face in modern life, whether for a busy student working on course assignments, a courier delivering packages, a server waiting on tables in a busy restaurant, a computer processing threads, or a machine on a complex assembly line. There are well-known empirical rules or heuristics to address to this question, among which \"first in, first out\", \"last in, first out\", or \"shortest job first\".  \n",
     "\n",
-    "What we consider in this notebook is the modeling finding solutions to this class of problem using optimization techniques. This notebook demonstrates the formulation of a model for scheduling a single machine scheduling using disjunctive programming in Pyomo. Data for the example problem is from Chapter 5 of the book by Christelle Gueret, Christian Prins, Marc Sevaux titled [Applications of Optimization with Xpress-MP](https://www2.isye.gatech.edu/~sahmed/isye3133b/XpressBook.pdf) (Dash Optimization, 2000).\n",
+    "What we consider in this notebook is the modeling finding solutions to this class of problem using optimization techniques. This notebook demonstrates the formulation of a model for scheduling a single machine scheduling using disjunctive programming in Pyomo. Data for the example problem is from Chapter 5 of the book by Christelle Guéret, Christian Prins, Marc Sevaux titled [Applications of Optimization with Xpress-MP](https://www2.isye.gatech.edu/~sahmed/isye3133b/XpressBook.pdf) (Dash Optimization, 2000).\n",
     "\n",
     "Consider the problem of scheduling a set of jobs on a single machine given the release time, duration, and due time for each job. Our goal is to find a sequence of the jobs on the machine that meets the due dates. If no such schedule exists, then the objective is to find the least bad schedule that minimizes a designated performance metric. "
    ]
diff --git a/notebooks/03/10-job-shop-scheduling.ipynb b/notebooks/03/10-job-shop-scheduling.ipynb
index efba8a7d..f33565d1 100644
--- a/notebooks/03/10-job-shop-scheduling.ipynb
+++ b/notebooks/03/10-job-shop-scheduling.ipynb
@@ -100,7 +100,7 @@
    "source": [
     "## Job shop example\n",
     "\n",
-    "The following example of a job shop is from from Christelle Gueret, Christian Prins, Marc Sevaux, \"Applications of Optimization with Xpress-MP,\" Dash Optimization, 2000.\n",
+    "The following example of a job shop is from Chapter 7 of the book by Christelle Guéret, Christian Prins, Marc Sevaux titled [Applications of Optimization with Xpress-MP](https://www2.isye.gatech.edu/~sahmed/isye3133b/XpressBook.pdf) (Dash Optimization, 2000).\n",
     "\n",
     "In this example, there are three printed paper products that must pass through color printing presses in a particular order. The given data consists of a flow sheet showing the order in which each job passes through the color presses\n",
     "\n",