Author:
Ibrahim Fahim Mohammed,Chachan Hanan Ali,Al-Zuky Ali A. D.
Abstract
In this study, we propose multi-objective functions which consist of the sum of completion time, tardiness time and earliness time where Ci denoted the completion time of job (i), Ti=max{Ci-di,0}, denotes the tardiness of job (i), Ei=max{di-Ci,0} be denoted the earliness of job (i).This problem is defined by // In this paper, we will present some theoretical analysis discussion, and prove when we have a problem with scheduling n jobs on two identical parallel machines (IPMSP).
Publisher
Al-Mustansiriyah Journal of Science
Reference25 articles.
1. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability (Vol. 174). San Francisco: freeman.
2. Alidaee, B., & Rosa, D. (1997). Scheduling parallel machines to minimize total weighted and unweighted tardiness. Computers & Operations Research, 24(8), 775-788.
3. CrossRef
4. [3] Azizoglu, M., & Kirca, O. (1998). Tardiness minimization on parallel machines. International Journal of Production Economics, 55(2), 163-168.
5. CrossRef