Journal of Applied Sciences1812-56541812-5662Asian Network for Scientific Information10.3923/jas.2008.4121.4128DavoudpourH.Hadji MolanaM.122008822In the classical scheduling problems, processing time
was assumed to be constant and takes predefined values. In many realistic
environments, such as machine maintaining or crisis event management,
processing time on each machine depends on the position of jobs on the
machine sequence or their starting time on that machine. We assume that
processing time was an increasing linear function of its start time, in
other words p_{ij} = α_{ij}t_{ij}, in the
literature these jobs were called deteriorating jobs. This problem addresses
classic n\m\f\C_{max} scheduling problem with a new assumption
on the processing time of the jobs and it was surmised in the format of
n\m\p,p_{ij} = α_{ij}t_{ij}\C_{max}.
We have used new Electro Magnetic meta-heuristic algorithm to find near
optimum solution and compared the results with the results obtained from
modified classical algorithms like CDS and Palmer.]]>Kunnathur, A.S. and S.K. Gupta,1990Alidaee, B. and N.K. Womer,1999Wu, C.C. and W.C. Lee,2006Palmer, D.S.,1965Taillard, E.,1993Mosheiov, G.,2002Mosheiov, G.,1998Mosheiov, G.,1995Mosheiov, G.,1994Campbell, H.G., R.A. Dudek and M.L. Smith,1970Gupta, J.N.D. and S.K. Gupta,1988Wang, J.B., C.T. Daniel Ng, T.C.E. Cheng and L.L. Liu,2006Kang, L. and C.T. Ng,2007Pinedo, M.,1995Ji, M. and T.C.E. Cheng,2008Sundararaghavan, P.S. and A.S. Kunnathur,1994Ruiz, R. and M. Concepcion,2005Gawiejnowicz, S., W. Kurc and L. Pankowska,2006Khalil, S.H. and M. Samson,2001Birbil, S.I. and S.C. Fang,2003Johnson, S.M.,1954Cheng, T.C.E., Q. Ding and B.M.T. Lin,2004Lee, W.C. and C.C. Wu,2008Lee, W.C., C.C. Wu, C.C. Wen and Y.H. Chung,2008Hsieh, Y.C. and D.L. Bricker,1997