Chapter 2, typo in the first term of Expression 2.1: It should read 1/k rather than 1/2.
(Thank you, Christine Nguyen, Northern Illinois University.)
Chapter 6, p. 57, line 2: “… reassignment after kzi …” should
be “… reassignment after kzi/Di …”. (Thank you,
Rongbing Huang, York University.)
Chapter 6, p. 64, line -12 should read “… from least cost ci”.
(Thank you, Ronald Mantel, University of Twente.)
Chapter 7, p. 85: All terms with zj should be deleted from constraints 7.5 and
7.6 and from the objective function. (Thank you, Yossi Bukchin, Tel-Aviv University.)
Chapter 8, p. 121, line -4: The equation should read s = s0 - S(V - V0).
This will also affect line 4 on the next page. (Thank you again, Ronald Mantel.)
Chapter 12, p. 206: Just above Equation 12.2 replace the word “travel” with
“cycle”. (Thank you, Brandon Mi, Georgia Tech.)
Chapter 15, pp. 257–258: In both Figures 15.2 and 15.3 the labels E’ and F’
should be switched. (Thank you again, Rongbing Huang, York University.)
The author cited as J. L. Heskitt should be J. L. Heskett. (Thank you again, Ronald Mantel!)
Chapter 2, pages 16 and 17: Theorem 2.1 and the several paragraphs preceding are wrong
because, contrary to my lazy assertion, average utilization is not equal to average
inventory divided by average space used. (Thank you, Luis Felipe Cardona Olarte of the
Universidad ICESI in Cali, Colombia.)
Chapter 8: Page 118, Section 8.5.6: The second inequality should be reversed. (Thank you, Wang Zhi.)
Chapter 9: Question 9.3 fails to mention that the shelf is of depth 9. Also, the solution is incorrect
in the teacher’s edition.
Chapter 7: The definition of ui is ambiguous. It should represent maximum number
of pallet locations required by sku i. To get this number, first estimate the maximum number
of pallets of sku i, then divide by the number of pallets of sku i per pallet location, and
round up. (Thank you, Li Tianjao.)
Chapter 7, Question 7.13 is incomplete and unanswerable as written. (Thank you, Wang Gancheng.)
Chapter 8: The caption to Table 8.1 (p. 132) contains some gibberish: Delete “Picks
are given in person-minutes and”.
page 76: The objective function at the bottom of the page has an error in sign of one of
the terms. The objective function expresses the total cost of the forward pick area and so
the cost of restocking should be added, not subtracted. (Thank you, Alexandre Blanquet.)
page 137, Figure 9.6: The figure is not wrong but will be replaced by a better one showing
the frequency with which the 100 most popular pairs of skus appeared in the same customer
order. Of these, one pair (#27) almost always constituted a complete customer order. That
is, if a customer ordered one of the pair, he almost always ordered the other and nothing else.
Page 300 of the teacher’s edition: The column listing number of pallets to allocate should
read 3, 2, 8, 2, 37, 1 instead of 2, 2, 4, 1, 18, 1. The remainder of the computations are
correct. (Thank you, O. Ozturkoglu, Auburn University.)
Page 304 of the teacher’s edition: The solution of Question 7.6B is incorrect: Some of
the numbers were copied incorrectly. (Thank you, E. Peregrina, Universidad Latina de Panama.)
page 61, line 6: The expression for pallet position-years per lane is incomplete. The
denominator should be 2Di rather than 2. (Thank you to Z. He, UMass-Amherst.)
page 49, Figure 6.2: The blue path is the shorter and the blue location is therefore the
more convenient. (Thank you N. Aguilera, Universidad ICESI.)
page 161: There are some typos in intermediate steps of the proof of convergence of a
2-worker bucket brigade.
pages 60, 61: Theorem 6.1 is correct but the derivation is garbled. Only the floor
positions should be counted as waste, not the above-ground positions. (Thank you, Bryan
Norman, University of Pittsburgh.)
page 180, end of the second paragraph, “Therefore the total travel cannot exceed
optimal by more than one revolution.”: This should be 1.5 revolutions (one-half a
revolution to match the endpoints of the shortest spanning intervals of the orders, and up
to a full revolution to construct the shortest tree spanning the resulting components.