1,025 research outputs found

    Stochastic make-to-stock inventory deployment problem: an endosymbiotic psychoclonal algorithm based approach

    Get PDF
    Integrated steel manufacturers (ISMs) have no specific product, they just produce finished product from the ore. This enhances the uncertainty prevailing in the ISM regarding the nature of the finished product and significant demand by customers. At present low cost mini-mills are giving firm competition to ISMs in terms of cost, and this has compelled the ISM industry to target customers who want exotic products and faster reliable deliveries. To meet this objective, ISMs are exploring the option of satisfying part of their demand by converting strategically placed products, this helps in increasing the variability of product produced by the ISM in a short lead time. In this paper the authors have proposed a new hybrid evolutionary algorithm named endosymbiotic-psychoclonal (ESPC) to decide what and how much to stock as a semi-product in inventory. In the proposed theory, the ability of previously proposed psychoclonal algorithms to exploit the search space has been increased by making antibodies and antigen more co-operative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results compared with other evolutionary algorithms such as genetic algorithms (GA) and simulated annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained and convergence time required to reach the optimal/near optimal value of the solution

    Symbiotic Tabu Search

    Get PDF

    Scientific research trends about metaheuristics in process optimization and case study using the desirability function

    Get PDF
    This study aimed to identify the research gaps in Metaheuristics, taking into account the publications entered in a database in 2015 and to present a case study of a company in the Sul Fluminense region using the Desirability function. To achieve this goal, applied research of exploratory nature and qualitative approach was carried out, as well as another of quantitative nature. As method and technical procedures were the bibliographical research, some literature review, and an adopted case study respectively. As a contribution of this research, the holistic view of opportunities to carry out new investigations on the theme in question is pointed out. It is noteworthy that the identified study gaps after the research were prioritized and discriminated, highlighting the importance of the viability of metaheuristic algorithms, as well as their benefits for process optimization

    Toward Robust Manufacturing Scheduling: Stochastic Job-Shop Scheduling

    Full text link
    Manufacturing plays a significant role in promoting economic development, production, exports, and job creation, which ultimately contribute to improving the quality of life. The presence of manufacturing defects is, however, inevitable leading to products being discarded, i.e. scrapped. In some cases, defective products can be repaired through rework. Scrap and rework cause a longer completion time, which can contribute to the order being shipped late. In addition, complex manufacturing scheduling becomes much more challenging when the above uncertainties are present. Motivated by the presence of uncertainties as well as combinatorial complexity, this paper addresses the challenge illustrated through a case study of stochastic job-shop scheduling problems arising within low-volume high-variety manufacturing. To ensure on-time delivery, high-quality solutions are required, and near-optimal solutions must be obtained within strict time constraints to ensure smooth operations on the job-shop floor. To efficiently solve the stochastic job-shop scheduling (JSS) problem, a recently-developed Surrogate "Level-Based" Lagrangian Relaxation is used to reduce computational effort while efficiently exploiting the geometric convergence potential inherent to Polyak's step-sizing formula thereby leading to fast convergence. Numerical testing demonstrates that the new method is more than two orders of magnitude faster as compared to commercial solvers

    Smart digital twin for ZDM-based job-shop scheduling

    Full text link
    [EN] The growing digitization of manufacturing processes is revolutionizing the production job-shop by leading it toward the Smart Manufacturing (SM) paradigm. For a process to be smart, it is necessary to combine a given blend of data technologies, information and knowledge that enable it to perceive its environment and to autonomously perform actions that maximize its success possibilities in its assigned tasks. Of all the different ways leading to this transformation, both the generation of virtual replicas of processes and applying artificial intelligence (AI) techniques provide a wide range of possibilities whose exploration is today a far from negligible sources of opportunities to increase industrial companiesÂż competitiveness. As a complex manufacturing process, production order scheduling in the job-shop is a necessary scenario to act by implementing these technologies. This research work considers an initial conceptual smart digital twin (SDT) framework for scheduling job-shop orders in a zero-defect manufacturing (ZDM) environment. The SDT virtually replicates the job-shop scheduling issue to simulate it and, based on the deep reinforcement learning (DRL) methodology, trains a prescriber agent and a process monitor. This simulation and training setting will facilitate analyses, optimization, defect and failure avoidance and, in short, decision making, to improve job-shop scheduling.The research that led to these results received funding from the European Union H2020 Programme with grant agreement No. 825631 Zero-Defect Manufacturing Platform (ZDMP) and Grant agreement No. 958205 Industrial Data Services for Quality Control in Smart Manufacturing (i4Q), and from the Spanish Ministry of Science, Innovation and Universities with Grant Agreement RTI2018-101344-B-I00 "Optimisation of zero-defects production technologies enabling supply chains 4.0 (CADS4.0)"Serrano Ruiz, JC.; Mula, J.; Poler, R. (2021). Smart digital twin for ZDM-based job-shop scheduling. IEEE. 510-515. https://doi.org/10.1109/MetroInd4.0IoT51437.2021.948847351051

    Integrated process planning and scheduling using genetic algorithms

    Get PDF
    Projektiranje tehnoloĆĄkih procesa i planiranje predstavljaju dvije najvaĆŸnije funkcije svakog proizvodnog procesa. Tradicionalno se one smatraju dvjema odvojenim funkcijama. U ovom se radu predlaĆŸe Genetički Algoritam (GA) za integraciju ovih aktivnosti, gdje se simultano odvija izbor najboljeg tehnoloĆĄkog procesa i vremenski plan poslova u pogonu. U radu se za rjeĆĄavanje te vrste problema predstavlja pristup zasnovan na proračunskoj tablici neovisnog područja. U modelu se razmatraju odnosi prvenstva u izvođenju poslova na temelju kojih se donosi implicitno predstavljanje mogućih planova za izvrĆĄenje svakog posla. Zbog provjere izvrĆĄenja i ostvarivosti predstavljenog pristupa, predloĆŸeni se algoritam provjeravao na nizu referentnih problema prilagođenih iz ranije objavljene literature. Eksperimentalni rezultati pokazuju da se predloĆŸenim pristupom mogu učinkoviti postići optimalna ili njima blizu rjeĆĄenja za probleme prilagođene iz literature. Također je pokazano da predloĆŸeni algoritam ima opću namjenu i moĆŸe se primijeniti za optimizaciju bilo koje objektivne funkcije bez promjene modela ili osnovne GA rutine.Process planning and scheduling are two of the most important functions in any manufacturing system. Traditionally process planning and scheduling are considered as two separate functions. In this paper a Genetic Algorithm (GA) for integrated process planning and scheduling is proposed where selection of the best process plan and scheduling of jobs in a job shop environment are done simultaneously. In the proposed approach a domain independent spreadsheet based approach is presented to solve this class of problems. The precedence relations among job operations are considered in the model, based on which implicit representation of a feasible process plans for each job can be done. To verify the performance and feasibility of the presented approach, the proposed algorithm has been evaluated against a number of benchmark problems that have been adapted from the previously published literature. The experimental results show that the proposed approach can efficiently achieve optimal or near-optimal solutions for the problems adopted from literature. It is also demonstrated that the proposed algorithm is of general purpose in application and could be used for the optimisation of any objective function without changing the model or the basic GA routine
    • 

    corecore