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

 Influence of Modification of Design out Maintenance & Design Out  Information System For Maintenance Cost Control & A Lucrative Business (With Case Study).

 Maintenance management is one of the main focuses in industrial sector. Maintenance in production environments is becoming increasingly complex as machines become more technologically advanced, therefore higher...

 Improvement in the reduction of PAPR for various M-Ary Phase modulations in MIMO-OFDM systems using Orthogonal variable spreading factor (OVSF)

 Orthogonal Frequency Division Multiplexing (OFDM) is regarded as one of the most eminent multicarrier modulation technique in fourth generation (4g) wireless networks, thus making it possible to transfer very high...

Synthesis of Proton Exchange Membranes from Acrylic Ester and Styrene Resin

In this work, an styrene-acrylic ester copolymer resin was used to synthesize proton exchange membranes for its application in fuel cells. The properties of these membranes were modified by the sulfonation reaction at di...

Using Apriori with WEKA for Frequent Pattern Mining

Knowledge exploration from the large set of data, generated as a result of the various data processing activities due to data mining only. Frequent Pattern Mining is a very important undertaking in data mining. Apriori a...

Design and Construction of a Simple but Efficient and Cost Effective Amplitude Modulated Transmitter Using Locally Available Materials

This work is an exploration of the design foundation and construction of an AM Transmitter. An AM transmitter controls the transmitting and broadcasting of signals that supports information conveyance in the AM Bandwidth...

Download PDF file
  • EP ID EP109360
  • DOI -
  • Views 109
  • 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