F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon et al., Approximation schemes for minimizing average weighted completion time with release dates, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.32-43, 1999.
DOI : 10.1109/SFFCS.1999.814574
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.172

J. Bruno, E. G. Coffman-jr, and R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications of the ACM, vol.17, issue.7, pp.382-387, 1974.
DOI : 10.1145/361011.361064

B. Chen, Y. Ye, and J. Zhang, Lot-sizing scheduling with batch setup times, Journal of Scheduling, vol.103, issue.1???3, pp.299-310, 2006.
DOI : 10.1007/s10951-006-8265-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6888

M. Drozdowski, Scheduling for Parallel Processing, 2009.
DOI : 10.1007/978-1-84882-310-5

J. Du, Y. Joseph, G. H. Leung, and . Young, Minimizing mean flow time with release time constraint, Theoretical Computer Science, vol.75, issue.3, pp.374-355, 1990.
DOI : 10.1016/0304-3975(90)90100-V
URL : http://doi.org/10.1016/0304-3975(90)90100-v

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of discrete mathematics, vol.5, issue.2, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

J. K. Lenstra, The mystical power of twoness: in memoriam Eugene L. Lawler, Journal of Scheduling, vol.1, issue.1, pp.3-14, 1998.
DOI : 10.1002/(SICI)1099-1425(199806)1:1<3::AID-JOS1>3.0.CO;2-B

Z. Liu, T. C. Edwin, and . Cheng, Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties, Journal of Scheduling, vol.7, issue.4, pp.313-327, 2004.
DOI : 10.1023/B:JOSH.0000031424.35504.c4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.509.3602

C. N. Potts and L. N. Van-wassenhove, Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity, Journal of the Operational Research Society, vol.43, issue.5, pp.395-406, 1992.
DOI : 10.1057/jors.1992.66

P. Schuurman and G. J. Woeginger, Preemptive scheduling with job-dependent setup times, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pp.759-767, 1999.

S. Van and . Ster, The allocation of scarce resources in disaster relief, 2010.

W. Xing and J. Zhang, Parallel machine scheduling with splitting jobs, Discrete Applied Mathematics, vol.103, issue.1-3, pp.259-269, 2000.
DOI : 10.1016/S0166-218X(00)00176-1
URL : http://doi.org/10.1016/s0166-218x(00)00176-1