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
- EP ID EP109360
- DOI -
- Views 94
- Downloads 0
Analyzing the Effects of Different Multimedia Materials on Learning System
Personalized learning has recently become an innovative trend in digital learning. The adaptive material could enhance the intention of learning, and motivate learner to concentrate on learning activity. Informatio...
Node Placement for Efficient Coverage in Homogeneous Wireless Sensor Networks
Coverage problems are caused due to the limited communication and sensing range between sensor nodes. The coverage problem casts a result of, how well an area is monitored or tracked by sensors. A good sensor deplo...
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...
Implementation Of 'CAN' Protocol In Automobiles Using Advance Embedded System
This paper describes the benefit of control systems with network architecture over traditional systems with a central processor. A suitable standard protocol, CAN, is briefly presented and its current and future use in a...
Design and Development of a Small Heat Exchanger as Auxiliary Cooling System for Domestic and Industrial Applications
The epileptic supply of power from the national grid in Nigeria has made many industries to engage Internal Combustion Engine generators as alternative to providing energy required for production. The excessive use of th...