Author:
Soukhal Ameur,Toung Nguyen Huynh
Reference44 articles.
1. Ahuja, R.K., Orlin, J.B.: A fast and simple algorithm for the maximum flow problem. Operations Research 37, 748–759 (1989)
2. Alidaee, B., Panwalkar, S.S.: Single stage minimum absolute lateness problem with a common due date on non-identical machines. Journal of the Operational Research Society 44(1), 29–36 (1993)
3. Bagchi, U., Sullivan, R.S., Chang, Y.L.: Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties about a common due-date. Naval Research Logistics 34(5), 739–751 (1987)
4. Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Operations Research 38, 22–36 (1990)
5. Baptiste, P., Brucker, P.: Scheduling equal processing time jobs. In JY Leung (Ed.): Handbook of scheduling: algorithms, models and performance analysis, CRC Press, Boca Raton, FL, USA (2004)