Abstract
In modern manufacturing the trend is the development of Computer Integrated Manufacturing, CIM technologies which is a computerized integration of manufacturing activities (Design, Planning, Scheduling and Control) produces right products 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). Shorting the make span leads to decreasing machines idle time which results improvement in CIM productivity. Conventional methods of solving scheduling problems based on priority rules still result schedules, sometimes, with significant idle times. To optimize these, this paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan. The work proposed here deal with the production planning problem of a flexible manufacturing system. This paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan. The objective is to minimize the make span 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 NP-hard for makespan objective. Consequently, comparison based on Gupta’s heuristics, RA heuristic’s, Palmer’s heuristics, CDS heuristics are proposed in this work. Gantt chart was generated to verify the effectiveness of the proposed approaches.
![[img]](http://ethesis.nitrkl.ac.in/style/images/fileicons/application_pdf.png)
Posts
0 comments:
Post a Comment