ADVANCED MODELISTIC APPROACH OF FLOWSHOP SCHEDULING PROBLEM FOR 10-JOBS, 10-MACHINES BY HEURISTICS MODELS USING MAKESPAN CRITERION

Journal Title: INTERNATIONAL JOURNAL OF ENGINEERING TRENDS AND TECHNOLOGY - Year 2013, Vol 4, Issue 5

Abstract

 Production scheduling is generally considered to be the one of the most significant 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 for 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 to complete jobs and consequently increasing the profitability of an organization in present competitive environment. There are different systems of production scheduling including flowshop in which jobs are to be processed through series of machines for optimizing number of required performance measures. In modern manufacturing there is the trend of the development of the Computer Integrated Manufacturing (CIM is computerized integration of the manufacturing activities (Design, Planning, Scheduling and Control)) 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 sorting 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 flowshop 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 makespan. The objective is to minimize the makespan of batch-processing machines in aflowshop. 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, comparisons based on RA’s heuristics, CDS’s heuristics are proposed in this work. Gantt chart is generated to verify the effectiveness of the proposed approaches.

Authors and Affiliations

Ajay Kumar Agarwal1 ; Rajan Garg

Keywords

Related Articles

A Survey on Various Defect Detection

Ceramic tiles having great demands in the field of infrastructure and building development because of its affordable cost, easy installation, maintenance, moisture resistant property and comes in a wide variety of colors...

 Palm Print Recognition Review Paper

 This paper provides an overview of some current palmprint research. Palmprint recognition has been investigated over the past decade. Palmprint recognition has five stagespalmprint acquisition, preprocessing, featu...

 A Review: Shadow Detection And Shadow Removal from Images.

 Shadows appear in remote sensing images due to elevated objects. Shadows cause hindrance to correct feature extraction of image features like buildings ,towers etc. in urban areas it may also cause false color...

High Speed Matrix Multiplication Implementation Using Field Programmable Gate Array

Matrix operations are commonly used in almost all areas of scientific research. Matrix multiplication has significant application in the areas of graph theory, numerical algorithms, signal processing, and digital control...

 A Pre-emptive Susceptive Design for Drowsy Driving Detection System

 Now-a-days there are perceptible road accidents occurring due to many reasons. Carelessness of driver is one of the reasons for accidents particularly during nights. The main objective of our project is to design a...

Download PDF file
  • EP ID EP109360
  • DOI -
  • Views 74
  • Downloads 0

How To Cite

Ajay Kumar Agarwal1 ; Rajan Garg (2013).  ADVANCED MODELISTIC APPROACH OF FLOWSHOP SCHEDULING PROBLEM FOR 10-JOBS, 10-MACHINES BY HEURISTICS MODELS USING MAKESPAN CRITERION. INTERNATIONAL JOURNAL OF ENGINEERING TRENDS AND TECHNOLOGY, 4(5), 1742-1749. https://europub.co.uk/articles/-A-109360