China 
Africa 
Explore chapters and articles related to this topic
A study of the effect of [BPy]PF6 as a flame retardant property
Published in Dawei Zheng, Industrial Engineering and Manufacturing Technology, 2015
Job shop scheduling problem is a branch of production scheduling in the production management of manufacturing processes, and exists almost ubiquitously in the industrial engineering world. In the market, job shop scheduling has become a key to reflect the competitiveness of manufacturing enterprise. It is a set of jobs for each operation and to define the sequence of the constrained operations on a set of machines to minimize the makespan. The purpose is to improve the production efficiency and reduce the processing duration so as to gain profits as high as possible. But JSSP is one of the hardest combinatorial optimization problems, and is a NP-hard problem which is to find the best schedule can be very difficult, depending on the shop environment and the constraint indicators [1]. Thereof, JSSP has aroused growing concerns and researches interest over the past decades.
Integration of Process Planning and Scheduling: Introduction
Published in Rakesh Kumar Phanden, Ajai Jain, J. Paulo Davim, Integration of Process Planning and Scheduling, 2019
Rakesh Kumar Phanden, Ajai Jain
It has been observed that a job shop is solved for static and dynamic scheduling environment by various researchers. Although there is still a gap between scheduling theory and practice. Therefore, the results of theoretical testing cannot be implemented in real setups directly. This is because most of the scheduling theories have considered job shop scheduling problem in isolation from higher-level functions, like process planning, that play a key role in the management of the manufacturing system (Gupta, 2002). Thus, the interaction between higher-level decision-making functions of management and lower-level scheduling function is a must to improve the performance of the manufacturing system and to implement the scheduling plan in real practice.
Digital-twin-based job shop multi-objective scheduling model and strategy
Published in International Journal of Computer Integrated Manufacturing, 2023
Zhuo Zhou, Liyun Xu, Xufeng Ling, Beikun Zhang
Efficient job shop scheduling is important for improving enterprise competitiveness and reducing production energy consumption. The job shop production mode is characterised by multiple varieties, small batches, different resource requirements, complex process routes, and multi-source disturbances (Liu et al. 2019; Baykasoglu, Madenoglu, and Hamzadayi 2020). Recently, with the rapid changes in the market environment, manufacturing enterprises have been encountering considerable development pressure. Enterprises must improve their production efficiency and implement product diversification strategies to enhance their competitiveness. As an important management component, efficient job shop scheduling can reduce production costs and enhance competitiveness (Delgado-Gomes, Oliveira-Lima, and Martins 2017). In addition, statistics show that the energy consumption of manufacturing industry accounts for approximately one-third of the global energy consumption. In large and developing industrialised countries, the manufacturing industry has a high proportion of energy consumption (International Energy Agency 2018). Recently, stringent constraints on energy consumption have been proposed for the manufacturing industry (Chou, Yang, and Wu 2020). Some countries will charge carbon tariffs on products causing large carbon emissions. Therefore, energy consumption must be accurately evaluated and optimised during production. Moreover, efficient job shop scheduling is an effective method for reducing energy consumption through reasonable production arrangements.
Towards flexible RFID event-driven integrated manufacturing for make-to-order production
Published in International Journal of Computer Integrated Manufacturing, 2018
Xifan Yao, Jianming Zhang, Yongxiang Li, Cunji Zhang
Priority rules are the most frequently applied heuristics for solving job shop scheduling problems in practice because of their ease of implementation and their low time complexity. Here we use ‘priority’ type of rules to solve such problems as workpieces inserted as follows:Jobs unprocessed with low priorities will be deferred temporarily and those being processed go on until the current operations are completed while an urgent workpiece arrives with a higher priority.Insert and process the urgent job as the schedule stored in its RFID tag according to priory ranking.