ADVANCED MODELISTIC APPROACH OF F LOWS HOP SCHEDULING PROBLEM FOR 10 - JOBS, 10 - MACHINES BY HEURISTICS MODELS USING MAKESPAN CRITERION
 |
International Journal of Engineering Trends and Technology (IJETT) | 
|
| © 2013 by IJETT Journal | ||
| Volume-4 Issue-5 |
||
| Year of Publication : 2013 | ||
| Authors : Ajay Kumar Agarwal , Rajan Garg |
Citation
Ajay Kumar Agarwal , Rajan Garg. "ADVANCED MODELISTIC APPROACH OF F LOWS HOP SCHEDULING PROBLEM FOR 10 - JOBS, 10 - MACHINES BY HEURISTICS MODELS USING MAKESPAN CRITERION ". International Journal of Engineering Trends and Technology (IJETT). V4(5):1742-1748 May 2013. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group.
Abstract
Production scheduling is generally considered to be the one of the most signi ficant issue in the planning and operation of a manufacturing system. Better scheduling system has significant impact on cost reduction, increased productivity, customer satisfaction and overall competitive advantage. In addition, recent customer demand fo r high variety products has contributed to an increase in product complexity that further emphasizes the need for improved scheduling. Proficient scheduling leads to increase in capacity utilization efficiency and hence thereby reducing the time required t o complete jobs and consequently increasing the profitability of an organization in present competitive environment. There are different systems of produ ction scheduling including flow shop in which jobs are to be processed through series of machines for op timizing number of required performance measures. In modern manufacturing there is the trend of the development of the Compute r Integrated Manufacturing (CIM is computerized integration of the manufacturing activities (Design, Planning, Scheduling and Cont rol) ) which produces right product(s) at right time to react quickly to the global competitive market demands. The productivity of CIM is highly depending upon the scheduling of Flexible Manufacturing System (FMS). Machine idle time can be decreased by sor ting the makespan which results in the improvement in CIM productivity. Conventional methods of solving scheduling problems based on priority rules still result schedule, sometimes with idle times. To optimize these, this paper models the problem of a flo w shop scheduling with the objective of minimizing the makespan. The work proposed here deal with the production planning problem of a flexible manufacturing system. This paper model the problem of a flowshop scheduling with the objective of minimizing the makes pan. The objec tive is to minimize the makespan of batch - processing machines in a flow shop. The processing times and the sizes of the jobs are known and non - identical. The machines can process a batch as long as its capacity is not exceeded. The processing time of a batch is the longest processing time among all the jobs in that batch. The problem under study is non - polynomial ( NP ) - hard for make span objective. Consequently, comparison s based on RA ’s heuristics, CDS ’s heuristic s are proposed in this work. Gantt chart i s generated to verify the effectiveness of the proposed approaches.
References
[1] Ajay Kumar Agarwal, R a ja n Ga r g, “ Advanced Modelistic Approach of Flow Shop Scheduling Problem for 10 - Jobs, 8 - Machines by Heuristics Models U sing Makespan Criterion”, International Journal of Innovative & Research Development Volume 2 Issue 4 (April 2013) 389 - 403
[2] Ajay Kumar Agarwal, Rajan Garg, “Flowshop Scheduling Problem for 10 - Jobs, 10 - Machines by Heuristics Models Using Make Span Criterion” , International Journal of Innovations in Engineering and Technology (IJIET) Issue 1, Vol. 2 (February 2013) 28 - 37
[3] Ajay Kumar Agarwal, Rajan Garg, “Advanced Modelistic Approach of Flowshop Scheduling Problem for 10 - Jobs, 8 - Machines by Heuristics Models Usi ng Makespan Criterion”, International Journal of Engineering, Business and Enterprises Applications (IJEBEA), Issue 3, Volume 2 (December, 2012 - February, 2013) 76 - 84
[4] Ajay Kumar Agarwal, R a ja n Ga r g, “ Advanced Modelistic Approach of Flow Shop Scheduling Prob lem for 8 - Jobs, 3 - Machines by Heuristics Models Using Make Span Criterion”, International Journal of Mechanical Science and Civil Engineering Volume 1 Issue 1 December 2012
[5] Ajay Kumar Agarwal, “Flow Shop Scheduling Problem for 8 - Jobs, 3 - Machines with Mak e Span Criterion” , International Journal of Applied Engineering Research ISSN 0973 - 4562 Vol. 7 No. 11 (2012) 1757 – 1762
[6] Gur Mosheiov, Assaf Sarig, “Due - date assignment on uniform machines”, European Journal of Operational Research 193 (2009) 49 - 58
[7] Dirk Bisku p , Jan Herrmann , “S i ngle - m achine scheduling against due dates with past - sequence - dependent setup ti m es” , European Journal of Operational Research 191 (2008) 587 – 592
[8] Xianyi W u , Xian Zhou, “Stochastic scheduling to m ini m ize expected m ax i m u m l a t e n e s s ”, European Journal of Operational Research 1 9 0 (2008) 103 – 115
[9] I.Drstvensek, I. Pahole, J. Balic, “A m odel of data flow in lower CIM levels” , Journal of M aterials Processin g Te chnology 157 – 158 (2004) 123 – 130
[10] K.H. Ecker , J.N.D. RA, “Scheduling tasks on a flexible m anufacturing m achine to m in i m ize tool change delays” , European Journal of Operational Research 164 (2005) 627 – 638
[11] Lixin Tang , Hua Gong, “A hybrid two - stage transportation and batch scheduling proble m ” , Applied Mathe m atical Modelling 32 (2008) 2467 – 2479
[12] Tamer Eren, Ertan Gu ?ner, “A bicriteria flowshop scheduling with a learning effect” , Applied Mathematic Modelling 32 (2008) 1719 - 1733
[13] Lixin Tang, Yufang Zh a o, “Schedul i ng a single se m i - continuous batching m achine”, O m ega 36 (2008) 992 – 1004
[14] Gur Mosheiov , Assaf Sarig, “Due - d ate as s ign m ent on unif o rm m achines”, European Journal of Ope r ational Research 193 (2009) 49 – 58
[15] Xianyi Wu, Xian Zhou, “Stochastic scheduling to minimize expected maximum lateness”, European Journal of Ope rational Research 190 (2008) 103 - 115
[16] Seong - Jong Joo, “Scheduling preventive maintenance for modular designed components: A dynamic approach”, European Journal of Operational Research 192 (2009) 512 - 520
[17] Yaohua He, Chi - Wai Hui, “A rule - based genetic algori thm for the scheduling of single - stage multi - product batch plants with parallel units”, Computers and Chemical Engineering 32 (2008) 3067 - 3083
Keywords
CIM; FMS; Flowshop scheduling problem; Make span; Heuristic models; Gantt chart .