Implementation of Lean Manufacturing Methodology to Improve Scheduling Performance for High-Mix Low Volume Production | Chapter 4 | Recent Progress in Science and Technology Vol. 8

 Fast change current in customer’s demand determines the type of production. The "extreme-mix and reduced volume" production has enhance the mainstream of result to meet customer’s need. The main problem of high-join low capacity production is significantly growing the frequency of start, causing an increase in set-up occasion for production. For methodical reduction strategies, Shingo projected a lean manufacturing methods called Single Minute Exchange of Die (SMED). The SMED methodology form it possible to reduce arrangement (changeover) movements time significantly. In this study, a rope processing association is used as a study case. The potential of faster setup maybe completely realized with SMED method. Furthermore, an revamped scheduling citation indicator is presented  for the cut carefully with sharp instrument machine that help resolution makers to determine the sequencing rule of organizing by each criterion through bureaucracy to improve the performance.

Author(s) Details:

Chuang-Chun Chiou,
Department of Industrial Engineering and Enterprise Information, Tunghai University, No. 1727, Sec. 4, Taiwan Blvd., Xitun Dist., Taichung City-407, Taiwan.

Shih-Shun Wang,
Department of Industrial Engineering and Enterprise Information, Tunghai University, No. 1727, Sec. 4, Taiwan Blvd., Xitun Dist., Taichung City-407, Taiwan.

Huynh Trung Luong,
Industrial Systems Engineering, Asian Institute of Technology. P.O. Box 4, 58 Moo 9, Km. 42, Paholyothin Highway, Klong Luang, Pathum Thani 12120 Thailand.

Please see the link here: https://stm.bookpi.org/RPST-V8/article/view/10060

Influence of Crossover Probability on Performance of Genetic Algorithm in Scheduling of Parallel Machines| Chapter 3 | Techniques and Innovation in Engineering Research and Technology Vol. 5

 In this division, an investigation of the influence of Crossover Probability on Genetic Algorithm (GA) conduct for the bi-criteria objective function to acquire the best resolution in a rational time in organizing of parallel machines is studied. A curious model for reducing the assigned work imbalance on the machines seeing work-in-process material is developed. The imitation on a proposed historical treasure was carried out accompanying a crossover probability of 0.4 to 0.95 (accompanying a step of 0.05) and 0.97, and it was discovered that the results were gathering for the crossover probability of 0.6 accompanying a computing opportunity of 3.41 seconds. The submitted algorithm assists the conclusion maker in analysing the objective function accompanying the computational time.

Author(s) Details:

B. V. Raghavendra,
Department of Mechanical Engineering, JSS Academy of Technical Education, Bengaluru – 560060, India.

Dayananda K. Pai,
Department of Aeronautical and Automobile Engineering, Manipal Institute of Technology, Manipal – 576104, India.

Please see the link here: https://stm.bookpi.org/TAIERT-V5/article/view/9054

Dynamic Scheduling for Flexible Manufacture: 15 Computer Programs | Book Publisher International

 The totality of events occurring in the production unit for a given planning period determines the dynamism of workshop planning. The order in which projects are scheduled is mostly determined by the cost of machine adjustments, initial setup, workshop schedule, availability of operators, tool wear, machine maintenance schedule, material delivery timetable, and other resources.

15 workshop schedule tasks are mentioned in the book.

To carry them out, dynamic schedules with two criteria are created at the same time: the first is the timeliness with which orders are fulfilled, and the second is the cost of processing and readjustment of manufactured things. A large portion of the book is devoted to programmes for evaluating conformity with regulations. Schedule calendar hours and machine operating hours in relation to the working calendar.

These responsibilities include order planning as well as in-stock planning; some are specific to discrete production, while others are specific to process production. As a result, the suggested calculating approach is applicable to a wide range of sectors. All of the tasks in the book are presented in a consistent manner, making it easier to become comfortable with them.

VBA Excel macro plain text is supplied for each of the 15 jobs. On an Excel page, the initial data for each job is entered, as well as the planning outcomes. Gantt charts, as well as other charts, are used to depict almost all tasks.


Author(s) Details

Yuri Mauergauz
Russian MES Center, Russian Federation.

View Book:- https://stm.bookpi.org/DSFM/article/view/6893

A Review of the Channel Modeling Characteristics and Techniques for Body Area Network | Chapter 4 | Current Approaches in Science and Technology Research Vol. 6

 Human voxel phantom communications are currently being fielded for wireless body area networks (WBAN). The channel's flexibility and characteristics are determined by the required environments and body situations. There are numerous challenges to using sensors to the patient for telecom techniques during simulation, such as the position of antennas on the body surface and inside the human. It leads to system inaccuracies and uncertainty. There are several numerical solutions that are useful for use in wireless body networks and simulation modeling. This paper's synopsis is based on esoteric research into the techniques used for the WBA communication channel. Routing classification, wireless technologies, benefits and drawbacks of the most popular application techniques are demonstrated and compared.

Author (s) Details

Ahmed Mohammed Q. AL-Asadi
Electrical Engineering Technical College, Middle Technical University Bagdad, Iraq.

Ahmed Ghanim Wadday
Engineering Technical College/Najaf Al-Furat Al Awsat Technical University Najaf, Iraq

View Book :- https://stm.bookpi.org/CASTR-V6/article/view/1717

A Detailed Conceptual Approach to Resources Allocation Scheduling | Chapter 8 | Theory and Practices of Mathematics and Computer Science Vol. 6

In everyday human activities, the issue of planning and allocating resources, both space and time, has created a lot of problems and has become of great concern. Several seminars and conferences were held to address the distribution of resources in various fields to select the best or suitable computational algorithms to solve this problem. The resource scheduling question deals with different parameters that are involved in the allocation of resources and related differences in the allocation of resources. The scheduling of resource distribution involves careful resource and time management for different users to prevent discrepancies in the timing of events. This paper provides a conceptual structure for solving problems with resource allocation scheduling using timetabling as a representative scheduling problem that involves careful resource and time management for different users to prevent conflicts in event timing. The work identifies the shortcomings of algorithms used to solve many timetabling problems such as the airplane roster, lecture schedules, etc. The paper aims to identify a good structure for the implementation of fuzzy algorithms that will be of great use to those who solve issues related to timetabling. Implementation of these system principles for the grouping of resources requires the requisite future works where there are no venue capacities to deal with such resources. A web implementation of the system is highly desirable and it could also integrate into it the development of other constraint-based scheduling activities such as review timetable.

Aurthor(s) Details:

A. A. Eludire
Department of Computer Science, Joseph Ayo Babalola University, Ikeji Arakeji, Nigeria.

C. O. Akanbi
Department of Information Communication Technology, Osun State University, Osogbo, Nigeria.

View Book :- https://stm.bookpi.org/TPMCS-V6/issue/view/6

Generic Scheduling by an Optimization Model Demonstrated for a Partly Automated Production Line | Chapter 2 | Recent Advances in Science and Technology Research Vol. 7

 Companies also use manufacturing processes that are specially built and change them from time to time. Such production systems, therefore have special technical limitations. In order to meet particular requirements with the least tardiness, they create small batches. This imposes high expectations on algorithms for high performance scheduling that can be easily adapted to changes in the production system. This paper proposes a common approach as a solution: solutions were obtained using a commonly used commercially available method for solving linear optimization models, which is available or can be linked to an Enterprise Resource Planning System (e.g. in the SAP system). This method is successfully used on a regular personal computer in a real-world application of a flow store with special limitations. The key assumption, therefore, is that the best solution could be optimal scheduling with a commercially available method.

Author (s) Details

Dr. Frank Herrmann
OTH Regensburg, Innovation and Competence Centre for Production Logistics and Factory Planning, P.O.Box 120327, Regensburg 93025, Germany.

View Book :- https://bp.bookpi.org/index.php/bpi/catalog/book/330