We consider the problem of allocating containers to ships in which the size of container is 1 or 2, and each ship has its own capacity and fixed departure time. The fixed departure times implies the completion times of containers belonging to the same ship are identical. As objectives, Lmax,...

Brucker et al. (Math Methods Oper Res 56: 407–412, 2003) have given an O(n 2 )-time algorithm for the problems $$P \mid p_{j}=1, r_{j}$$ , outtree $$\mid \sum C_{j}$$ and $$P \mid pmtn, p_{j}=1, r_{j}$$ , outtree $$\mid \sum C_{j}$$ . In this note, we show that their algorithm admits an O(n...

Brucker et al. (Math Methods Oper Res 56: 407–412, 2003) have given an O(n <Superscript>2</Superscript>)-time algorithm for the problems <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$P \mid p_{j}=1, r_{j}$$</EquationSource> </InlineEquation>, outtree <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$\mid \sum C_{j}$$</EquationSource> </InlineEquation> and <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$P \mid pmtn, p_{j}=1, r_{j}$$</EquationSource> </InlineEquation>, outtree <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$$\mid \sum C_{j}$$</EquationSource> </InlineEquation>. In this note, we show that their algorithm admits an...</equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></superscript>