# Erratum to: Flow shops with WIP and value added costs

Erratum

First Online:

- 729 Downloads
- 2 Citations

## Erratum to: J Sched (2010) 13:3–16 DOI 10.1007/s10951-009-0130-z

We correct four errors in our paper. The first is that the equationon Page 5 in Sect. 2 should readThe next error concerns Lemma 2. As stated, it is incorrect. Hatem Hadda noticed that the lemma holds when there are only two machines. We observe that it also holds for the \(m\)-machine case by changing the statement slightly to:

$$\begin{aligned} W_j = \sum \limits _{i=1}^m (w_{2i-1}Q_{2i-1,j}+w_{2i}p_{2i,j}) \end{aligned}$$

$$\begin{aligned} W_j = \sum \limits _{i=1}^m (w_{2i-1}Q_{ij}+w_{2i}p_{ij}). \end{aligned}$$

### **Lemma 2**

For the problem \(F||\sum W_j\), suppose that \(p_{ij} \ge p_{i+1,j}\) for all \(i \in M \setminus \{m\}\) and \(j \in N\). Also, suppose that \(\sum \nolimits _{i=1}^{k} p_{ij} \le \sum \nolimits _{i=1}^{k} p_{i,j+1}\) for all \(k \in M\) and \(j \in N \setminus \{n\}\). Then, scheduling the jobs without inserted idle time in the order \((1, 2,\ldots ,n)\) is optimal.

The final errors are in the statement of Lemma 3, which contains two typos. The first is that \([j]\) should mean the job in position \(j\) on Machine \(l\) (should be

**not**Machine \(m\)). The second is that the first term after the inequality$$\begin{aligned} w_1 n \sum \limits _{i=1}^{l-1} p_{i[l]} \end{aligned}$$

$$\begin{aligned} w_1 n \sum \limits _{i=1}^{l-1} p_{i[1]}. \end{aligned}$$

## Notes

### Acknowledgments

We thank Hatem Hadda for noticing the errors in our paper.

## Copyright information

© Springer Science+Business Media New York 2015