As global competition has intensified in the automotive industry, there is a strong need for management teams to develop methods that allow accurate and objective assessments of plant productivity identify improvement opportunities best manufacturing practices. Stochastic frontier analysis (SFA) models have been used as statistical benchmarking tool provide bird’s-eye view an industrial sector....

This thesis deals mainly with makespan minimization in Flow-Shop and hybrid Flow-Shop scheduling problems where mixed blocking constraints are considered. In Flow-Shop scheduling problem, a set of N jobs must be executed on a set of M machines. All jobs require the same operation order that must be executed according to the same manufacturing process. Each machine can only execute one job at an...

This paper involves the study of a simulation based proactive decision support module for the shop-floor scheduling of the Plastic Processing Section (PPS) at Bharti Telecom Limited, Gurgaon, India. The flow of material and information in this shop is highly complex as it involves multiple product parts, sequence dependent setup, molding machine specifications, mould restrictions etc. with a va...

Although feature-based computer-aided process planning plays a vital role in automating and integrating design and manufacturing for ef®cient production, its off-line properties prohibit the shop ̄oor controllers from rapidly coping with unexpected production errors. The objective of the paper is to suggest a neural network-based dynamic planning model, by which the shop ̄oor controllers determin...

Modern smartphones provide a high sophisticated camera and a high resolution display. Therefore, they can be used to enable various application scenarios for 1D and 2D barcode recognition as well as barcode presentation device. The device positioning against the barcode allows innovative interaction: e.g., additional product information or “rail information” on paper tickets. In the future, the...

The job shop scheduling problem (JSSP) has attracted much attention in the field of both information sciences and operations research. This paper considers the permutation Job shop scheduling problem with the objective of minimizing make span. Artificial Bee Colony algorithm (ABC) is one of the search heuristics used to solve global optimization problems in complex search spaces. It is observed...

Production planning is performed through diverse methods according to the type of the system it is structured upon. One of the most important steps before production planning is to determine which system best fits the firm, and how the facilities should be designed. Both job-shop and group-technology systems have their own pros and cons, each of which is suitable to a specific kind of factory. ...

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...