The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose a genetic algorithm (GA) to solve a realistic variant of flowshop problem. The variant considered here is a hybrid flexible flowshop problem with sequence-dependent setup times, and with the objective of minimizing the makespan. This type of flowshop is frequently used in the batch production, helping toreduce the gap between research and operational use. The proposed approach...
This paper's proposed the adaptive multi-agent collaborative manufacturing product structure service chain model and discussed its construction technology for the complex collaborative manufacturing task and the lack of appropriate building technology, based on the collaborative production scheduling, in view of the expert decision-making optimization's genetic algorithm and MAS technology as a whole...
In this paper, advanced planning and scheduling (APS) in which each customer order has an absolute due date and outsourcing is available in a manufacturing supply chain is addressed. An integer programming model is presented to solve the APS problem. The objective is to minimize the makespan of each customer order while satisfying the due date constraints. The proposed model considers the integration...
The manufacturing flow between steel-making and continuous-casting is a complex multi-phase and multi-product production process. The production scheduling problem in this flow can be seen as Job Shop Problem. An improved genetic algorithm for solving this problem is proposed. Fourteen benchmarks are comparatively investigated and it shows that the improved genetic algorithm has the better capability...
In our previous works, we have proposed a new approach based on genetic algorithms and the learning by injection of sequences for solving the Flexible Job-shop Scheduling Problem (FJSP). This approach was based on a joint resolution of the inherent assignment subproblem and the sequencing subproblem with total flexibility. In this paper, we develop a new strategy of learning (partial injection of...
Since the ACMS does not only focus on working but also enhances workers' skill using the Post-OJT system, we developed a New OJT in order to accomplish the practical Post-OJT system. The Post-OJT objects to enhance the workers' skill succession thus, the development of scheduling system for allocation both of the right man on the right job and skill succession training time is required. In this paper,...
Machine scheduling is a critical problem in industries where products are custom-designed. The wide range of products, the lack of previous experiences in manufacturing, and the several conflicting criteria used to evaluate the quality of the schedules define a huge search space. Furthermore, production complexity and human influence in each manufacturing step make time estimations difficult to obtain...
An approach using the concept of self-adapted hybrid genetic algorithm (AGASA) is proposed as a powerful but simple means to optimize job scheduling in distributed manufacturing system (DMS). A directed graph model is developed to describe the characteristics of DMS. The superiority of the proposed algorithm is illustrated by computing result with pattern of GANTT graph, and the results are compared...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.