Reason-A Technical Journal (Formerly Reason-A Technical Magazine)

Open Access Open Access  Restricted Access Subscription Access

Optimal Scheduling of Multiple Deteriorated Machines for Multiple Jobs


Affiliations
1 Department of Mathematics, Sanaka Educational Trust Group of Institutions, Durgapur, India
2 Department of Mathematics, National Institute Technology, Durgapur, India
 

This paper is about proper scheduling of the jobs in deteriorated machines with theconsiderationthat machines have different processing time for same job depending upon the deterioration. At first a heuristic process is applied to determine the machine schedule to optimize the processing time for given jobs considering the deterioration of each machine. This enablesone to find proper order of jobs in each machine.Rate Modified Activity (RMA) is used to detect whether the next set of jobs can be processed by any machine or needs a rest to get full energy for the next job. After solving by above method, A.C.O. (Ant Colony Optimization)is introduced to find better alternative solutions. The main objective is to find a time interval by ACO, in which many alternative solutions of scheduling of jobs will be possible considering the deteriorated machines formulti machine multi job system. Another objectiveis to find scheduling so that penalties like tardiness andcan be minimized.

Keywords

Scheduling, Make Span, Deterioration, Rma, A.C.O., Ant Colony Optimization.
User
Notifications
Font Size


  • Browne, S. and Yechiali, U., Scheduling Deteriorating Jobs on a Single Processor,Journal Article Operations Research,Vol. 38, pp. 495-498, No. 3, 1990.

  • Min, J., He, Y. and Cheng, T.C.E.,SingleMachine Scheduling with Periodic Maintenance to Minimize Makespan, Computers & Operations Research, Vol. 34, No.6, 2007.

  • Inderfurth, K., Kovalyov, M.Y. and Ng, C.T.D., Cost Minimizing Scheduling of Work and Rework Processes on a Single Facility under Deterioration of Reworkables, Frank WerneraInternational Journal of Production Economics,Vol. 105, No.2, pp.345–356, 2007.

  • Wang, X. and Cheng, T.C.E., SingleMachine Scheduling with Deteriorating Jobs and Learning Effects to Minimize the Makespan, European Journal of Operational Research, Vol.178, No.1, pp.57-60, 2007.

  • Lee, W.C., Wu, C.C. and Chung, Y.H.,A Single-Machine Deteriorating Job Scheduling Problem of Minimizing the Makespan with Release Times, Proceedings of the International MultiConference of Engineers and Computer Scientists,Vol. II, Hong Kong, 2008.

  • Lee, W.C. and Wu, C.C., Multi-Machine Scheduling with Deteriorating Jobs and Scheduled Maintenance, Applied Mathematical Modelling, Vol. 32, No.3, pp.362–373, 2008.

  • Lee, C.Y. and Leon, V.J., Machine Scheduling with a Rate-Modifying Activity, European Journal of Operational Research, Vol. 128, pp.119–128,2001.

  • Hsu, C.J., Cheng,T.C.E. and Yang,D.L., Unrelated Parallel-Machine Scheduling with Rate-Modifying Activities to Minimize the Total Completion Time, Information Sciences, Vol. 181, No.20, pp. 4799-4803,2011.

  • Cheng,T.C.E. and Ding, Q., Single Machine Scheduling with Step-Deteriorating Processing Times, Computers & Operations Research, Vol.32, pp.521–536, 2005.

  • Ng, C.T., Cheng,T.C.E., Bachman, A.and Janiak, A., Three Scheduling Problems with Deteriorating Jobs to Minimize the Total Completion Time, Journal OPTIMAL SCHEDULING OF MULTIPLE DETERIORATED MACHINES FOR MULTIPLE JOBS Information Processing Letter, Vol. 81, No.6, pp.327-333, 2002.

  • He, Y.,Ji, M. and Cheng, T.C.E., Single Machine Scheduling with a Restricted Rate-Modifying Activity, Naval Research Logistics, Vol. 52, No.4,pp.361-369, 2005.

  • Lodree, E.J. and Geiger,C.D., A Note on the Optimal Sequence Position for a Rate-Modifying Activity under Simple Linear Deterioration, European Journal of Operational Research, Vol. 201, No.2, pp.644-6481, 2010.

  • Ozturkoglu, Y. and Bulfin, R.L., A Unique Integer Mathematical Model for Scheduling Deteriorating Jobs with Rate-Modifying Activities on a Single Machine,International Journal of Advanced Manufacturing

  • Technology, Vol. 57, No.5, pp.753–762, 2011,

  • lmaz, O.Y.Y., Solving Scheduling Deteriorating Jobs with Rate Modifying Activity, A Doctoral Dissertation Submitted to the Graduate Faculty of Auburn University, Alabama, USA,2011.

  • Jean-Paul, A., Rami, M. and Ghaith, R., Ant Colony Optimization Algorithm to Parallel Machine Scheduling Problem with Setups,IEEE International Conference on Automation Science and Engineering (CASE 2008), 2008.

  • Bhattacharya, R. andKar, S., Ant Colony Optimization: an Overview, Conference Proceeding on Advanced in Computational optimizationand Applications,Narosa Publishing House, pp.48-70, 2012.

  • Gupta, S.K. and Kyparisis, J.,Single Machine Scheduling Research, Omega: Computers & Mathematics with Applications, Vol. 19, No.2, pp.1-7, 1990.

  • Gupta, M.C., Gupta, Y.P. and Kumar, A., Minimizing Flow Time Variance in a Single Machine System Using Genetic Algorithms, European Journal of Operational Research, Vol. 70, No. 3, pp.289-303, 1993.

  • Kunnathur, A.S. and Gupta, S.K., Minimizing the Makespan with Late Start Penalties Added to Processing Times in a Single Facility Scheduling Problem, European Journal of Operational Research, Vol.47, No.1, pp.56-64, 1990.


Abstract Views: 498

PDF Views: 176




  • Optimal Scheduling of Multiple Deteriorated Machines for Multiple Jobs

Abstract Views: 498  |  PDF Views: 176

Authors

Pallab Kumar Sarkhel
Department of Mathematics, Sanaka Educational Trust Group of Institutions, Durgapur, India
Gaurav Vishal
Department of Mathematics, National Institute Technology, Durgapur, India

Abstract


This paper is about proper scheduling of the jobs in deteriorated machines with theconsiderationthat machines have different processing time for same job depending upon the deterioration. At first a heuristic process is applied to determine the machine schedule to optimize the processing time for given jobs considering the deterioration of each machine. This enablesone to find proper order of jobs in each machine.Rate Modified Activity (RMA) is used to detect whether the next set of jobs can be processed by any machine or needs a rest to get full energy for the next job. After solving by above method, A.C.O. (Ant Colony Optimization)is introduced to find better alternative solutions. The main objective is to find a time interval by ACO, in which many alternative solutions of scheduling of jobs will be possible considering the deteriorated machines formulti machine multi job system. Another objectiveis to find scheduling so that penalties like tardiness andcan be minimized.

Keywords


Scheduling, Make Span, Deterioration, Rma, A.C.O., Ant Colony Optimization.

References





DOI: https://doi.org/10.21843/reas%2F2016%2F80-89%2F158779