Reverse Engineering on Process Cycle Time in a Medium Scale Industry (original) (raw)
Reverse Engineering (Back Engineering) is the process of extracting knowledge or design information from anything man-made and re-producing it or re-producing anything based on the extracted information. There are two types of engineering, forward engineering and reverse engineering. Forward engineering is the traditional process of moving from high-level abstractions and logical designs to the physical implementation of a system. This is a thesis for people interested in Reverse Engineering (RE) from an industrial perspective. Several journal papers have discussed issues related to RE, but there is a huge gap in practical literature in this field, especially in manufacturing. We are implementing RE on process cycle time in a Medium Scale Industry to cross-check whether the existing process cycle time is minimal or not and to give suggestion on the same for their efficient and profitable production system. Conventional methods of solving scheduling problems based on priority rules still result schedules, sometimes, with significant idle times but not so optimal. The work proposed here deal with the production planning problem of a flow shop scheduling problem of a medium scale industry. The pages of this dissertation model the problem of a flow shop scheduling with the objective of minimizing the makespan. 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 makes span objective. Consequently, comparison based on Palmer’s heuristics, CDS’s heuristics, RA’s heuristics and NEH’s heuristics are proposed in this work. Gantt chart is generated to verify the effectiveness of the proposed approaches. The findings of this dissertation has suggested to the concerned company for further improvement in process cycle time by implementing the optimal sequence of J1 - J3 - J4 - J2 with an optimal makespan of 348.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.