Bibliography

1

S. Albers and P. Brucker.
The complexity of one-machine batching problems.
Discrete Appl. Math., 47(2):87-107, 1993.

2

P. Baptiste.
Batching identical jobs.
Math. Methods Oper. Res., 52(3):355-367, 2000.

3

P. Baptiste and A. Jouglet.
On minimizing total tardiness in a serial batching problem.
RAIRO Oper. Res., 35(1):107-115, 2001.

4

P. Brucker and M.Y. Kovalyov.
Single machine batch scheduling to minimize the weighted number of late jobs.
Math. Methods Oper. Res., 43(1):1-8, 1996.

5

E.G. Coffman, Jr., M. Yannakakis, M.J. Magazine, and C. Santos.
Batch sizing and job sequencing on a single machine.
Ann. Oper. Res., 26(1-4):135-147, 1990.

6

J. Du and J.Y.-T. Leung.
Minimizing total tardiness on one machine is NP-hard.
Math. Oper. Res., 15(3):483-495, 1990.

7

R.M. Karp.
Reducibility among combinatorial problems.
In Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), pages 85-103. Plenum, New York, 1972.

8

E.L. Lawler.
Sequencing jobs to minimize total weighted completion time subject to precedence constraints.
Ann. Discrete Math., 2:75-90, 1978.

9

J.K. Lenstra and A.H.G. Rinnooy Kan.
Complexity of scheduling under precedence constraints.
Oper. Res., 26(1):22-35, 1978.

10

J.K. Lenstra and A.H.G. Rinnooy Kan.
Complexity results for scheduling chains on a single machine.
European J. Oper. Res., 4(4):270-275, 1980.

11

J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker.
Complexity of machine scheduling problems.
Ann. of Discrete Math., 1:343-362, 1977.

12

C.T. Ng, T.C.E. Cheng, and J.J. Yuan.
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.
Oper. Res. Lett., 30:66-68, 2002.