COMBINATION OF ACO AND PSO TO MINIMIZE MAKESPAN IN ORDERED FLOWSHOP SCHEDULING PROBLEMS

The problem of scheduling flowshop production is one of the most versatile problems and is often encountered in many industries. Effective scheduling is important because it has a significant impact on reducing costs and increasing productivity. However, solving the ordered flowshop scheduling problem with the aim of minimizing makespan requires a difficult computation known as NP-hard. This research will contribute to the application of combination ACO and PSO to minimize makespan in the ordered flowshop scheduling problem. The performance of the proposed scheduling algorithm is evaluated by testing the data set of 600 ordered flowshop scheduling problems with various combinations of job and machine size combinations. The test results show that the ACO-PSO algorithm is able to provide a better scheduling solution for the scheduling group with small dimensions, namely 76 instances from a total of 600 inctances and is not good at obtaining makespan in the scheduling group with large dimensions. The ACO-PSO algorithm uses execution time which increases as the dimension size (multiple jobs and many machines) increases in a scheduled instanc

An investigation into minimising total energy consumption and total completion time in a flexible job shop for recycling carbon fiber reinforced polymer

The increased use of carbon fiber reinforced polymer (CFRP) in industry coupled with European Union restrictions on landfill disposal has resulted in a need to develop relevant recycling technologies. Several methods, such as mechanical grinding, thermolysis and solvolysis, have been tried to recover the carbon fibers. Optimisation techniques for reducing energy consumed by above processes have also been developed. However, the energy efficiency of recycling CFRP at the workshop level has never been considered before. An approach to incorporate energy reduction into consideration while making the scheduling plans for a CFRP recycling workshop is presented in this paper. This research sets in a flexible job shop circumstance, model for the bi-objective problem that minimise total processing energy consumption and makespan is developed. A modified Genetic Algorithm for solving the raw material lot splitting problem is developed. A case study of the lot sizing problem in the flexible job shop for recycling CFRP is presented to show how scheduling plans affect energy consumption, and to prove the feasibility of the model and the developed algorithm

Dagstuhl Reports : Volume 1, Issue 2, February 2011

Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn

Scheduling with processing set restrictions : a survey

2008-2009 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

An economic lot and delivery scheduling problem with the fuzzy shelf life in a flexible job shop with unrelated parallel machines

This paper considers an economic lot and delivery scheduling problem (ELDSP) in a fuzzy environment with the fuzzy shelf life for each product. This problem is formulated in a flexible job shop with unrelated parallel machines, when the planning horizon is finite and it determines lot sizing, scheduling and sequencing, simultaneously. The proposed model of this paper is based on the basic period (BP) approach. In this paper, a mixed-integer nonlinear programming (MINLP) model is presented and then it is changed into two models in the fuzzy shelf life. The main model is dependent to the multiple basic periods and it is difficult to solve the resulted proposed model for large-scale problems in reasonable amount of time; thus, an efficient heuristic method is proposed to solve the problem. The performance of the proposed model is demonstrated using some numerical examples

Comparative simulation study of production scheduling in the hybrid and the parallel flow

Scheduling is one of the most important decisions in production control. An approach is proposed for supporting users to solve scheduling problems, by choosing the combination of physical manufacturing system configuration and the material handling system settings. The approach considers two alternative manufacturing scheduling configurations in a two stage product oriented manufacturing system, exploring the hybrid flow shop (HFS) and the parallel flow shop (PFS) environments. For illustrating the application of the proposed approach an industrial case from the automotive components industry is studied. The main aim of this research to compare results of study of production scheduling in the hybrid and the parallel flow, taking into account the makespan minimization criterion. Thus the HFS and the PFS performance is compared and analyzed, mainly in terms of the makespan, as the transportation times vary. The study shows that the performance HFS is clearly better when the work stations' processing times are unbalanced, either in nature or as a consequence of the addition of transport times just to one of the work station processing time but loses advantage, becoming worse than the performance of the PFS configuration when the work stations' processing times are balanced, either in nature or as a consequence of the addition of transport times added on the work stations' processing times. This means that physical layout configurations along with the way transport time are including the work stations' processing times should be carefully taken into consideration due to its influence on the performance reached by both HFS and PFS configurations.This work was supported by National Funds through FCT "Fundacao para a Ciencia e a Tecnologia" under the program: PEst2015-2020, ref. UID/CEC/00319/2013.info:eu-repo/semantics/publishedVersio