A new adaptive neural network and heuristics hybrid approach for job-shop scheduling

Copyright @ 2001 Elsevier Science LtdA new adaptive neural network and heuristics hybrid approach for job-shop scheduling is presented. The neural network has the property of adapting its connection weights and biases of neural units while solving the feasible solution. Two heuristics are presented, which can be combined with the neural network. One heuristic is used to accelerate the solving process of the neural network and guarantee its convergence, the other heuristic is used to obtain non-delay schedules from the feasible solutions gained by the neural network. Computer simulations have shown that the proposed hybrid approach is of high speed and efficiency. The strategy for solving practical job-shop scheduling problems is provided.This work is supported by the National Nature Science Foundation (No. 69684005) and National High -Tech Program of P. R. China (No. 863-511-9609-003)

Industrial water management by multiobjective optimization: from individual to collective solution through eco-industrial parks.

Industrial water networks are designed in the first part by a multiobjective optimization strategy, where fresh water, regenerated water flow rates as well as the number of network connections (integer variables) are minimized. The problem is formulated as a Mixed-Integer Linear Programming problem (MILP) and solved by the ε-constraint method. The linearization of the problem is based on the necessary conditions of optimality defined by Savelski and Bagajewicz (2000). The approach is validated on a published example involving only one contaminant. In the second part the MILP strategy is implemented for designing an Eco-Industrial Park (EIP) involving three companies. Three scenarios are considered: EIP without regeneration unit, EIP where each company owns its regeneration unit and EIP where the three companies share regeneration unit(s). Three possible regeneration units can be chosen, and the MILP is solved under two kinds of conditions: limited or unlimited number of connections, same or different gains for each company. All these cases are compared according to the global equivalent cost expressed in fresh water and taking also into account the network complexity through the number of connections. The best EIP solution for the three companies can be determined

Best matching processes in distributed systems

The growing complexity and dynamic behavior of modern manufacturing and service industries along with competitive and globalized markets have gradually transformed traditional centralized systems into distributed networks of e- (electronic) Systems. Emerging examples include e-Factories, virtual enterprises, smart farms, automated warehouses, and intelligent transportation systems. These (and similar) distributed systems, regardless of context and application, have a property in common: They all involve certain types of interactions (collaborative, competitive, or both) among their distributed individuals—from clusters of passive sensors and machines to complex networks of computers, intelligent robots, humans, and enterprises. Having this common property, such systems may encounter common challenges in terms of suboptimal interactions and thus poor performance, caused by potential mismatch between individuals. For example, mismatched subassembly parts, vehicles—routes, suppliers—retailers, employees—departments, and products—automated guided vehicles—storage locations may lead to low-quality products, congested roads, unstable supply networks, conflicts, and low service level, respectively. This research refers to this problem as best matching, and investigates it as a major design principle of CCT, the Collaborative Control Theory. The original contribution of this research is to elaborate on the fundamentals of best matching in distributed and collaborative systems, by providing general frameworks for (1) Systematic analysis, inclusive taxonomy, analogical and structural comparison between different matching processes; (2) Specification and formulation of problems, and development of algorithms and protocols for best matching; (3) Validation of the models, algorithms, and protocols through extensive numerical experiments and case studies. The first goal is addressed by investigating matching problems in distributed production, manufacturing, supply, and service systems based on a recently developed reference model, the PRISM Taxonomy of Best Matching. Following the second goal, the identified problems are then formulated as mixed-integer programs. Due to the computational complexity of matching problems, various optimization algorithms are developed for solving different problem instances, including modified genetic algorithms, tabu search, and neighbourhood search heuristics. The dynamic and collaborative/competitive behaviors of matching processes in distributed settings are also formulated and examined through various collaboration, best matching, and task administration protocols. In line with the third goal, four case studies are conducted on various manufacturing, supply, and service systems to highlight the impact of best matching on their operational performance, including service level, utilization, stability, and cost-effectiveness, and validate the computational merits of the developed solution methodologies

Mathematical Multi-Objective Optimization of the Tactical Allocation of Machining Resources in Functional Workshops

In the aerospace industry, efficient management of machining capacity is crucial to meet the required service levels to customers and to maintain control of the tied-up working capital. We introduce new multi-item, multi-level capacitated resource allocation models with a medium--to--long--term planning horizon. The model refers to functional workshops where costly and/or time- and resource-demanding preparations (or qualifications) are required each time a product needs to be (re)allocated to a machining resource. Our goal is to identify possible product routings through the factory which minimize the maximum excess resource loading above a given loading threshold while incurring as low qualification costs as possible and minimizing the inventory.In Paper I, we propose a new bi-objective mixed-integer (linear) optimization model for the Tactical Resource Allocation Problem (TRAP). We highlight some of the mathematical properties of the TRAP which are utilized to enhance the solution process. In Paper II, we address the uncertainty in the coefficients of one of the objective functions considered in the bi-objective TRAP. We propose a new bi-objective robust efficiency concept and highlight its benefits over existing robust efficiency concepts. In Paper III, we extend the TRAP with an inventory of semi-finished as well as finished parts, resulting in a tri-objective mixed-integer (linear) programming model. We create a criterion space partitioning approach that enables solving sub-problems simultaneously. In Paper IV, using our knowledge from our previous work we embarked upon a task to generalize our findings to develop an approach for any discrete tri-objective optimization problem. The focus is on identifying a representative set of non-dominated points with a pre-defined desired coverage gap

Systematic categorization of optimization strategies for virtual power plants

Due to the rapid growth in power consumption of domestic and industrial appliances, distributed energy generation units face difficulties in supplying power efficiently. The integration of distributed energy resources (DERs) and energy storage systems (ESSs) provides a solution to these problems using appropriate management schemes to achieve optimal operation. Furthermore, to lessen the uncertainties of distributed energy management systems, a decentralized energy management system named virtual power plant (VPP) plays a significant role. This paper presents a comprehensive review of 65 existing different VPP optimization models, techniques, and algorithms based on their system configuration, parameters, and control schemes. Moreover, the paper categorizes the discussed optimization techniques into seven different types, namely conventional technique, offering model, intelligent technique, price-based unit commitment (PBUC) model, optimal bidding, stochastic technique, and linear programming, to underline the commercial and technical efficacy of VPP at day-ahead scheduling at the electricity market. The uncertainties of market prices, load demand, and power distribution in the VPP system are mentioned and analyzed to maximize the system profits with minimum cost. The outcome of the systematic categorization is believed to be a base for future endeavors in the field of VPP development

Supply Chain

Traditionally supply chain management has meant factories, assembly lines, warehouses, transportation vehicles, and time sheets. Modern supply chain management is a highly complex, multidimensional problem set with virtually endless number of variables for optimization. An Internet enabled supply chain may have just-in-time delivery, precise inventory visibility, and up-to-the-minute distribution-tracking capabilities. Technology advances have enabled supply chains to become strategic weapons that can help avoid disasters, lower costs, and make money. From internal enterprise processes to external business transactions with suppliers, transporters, channels and end-users marks the wide range of challenges researchers have to handle. The aim of this book is at revealing and illustrating this diversity in terms of scientific and theoretical fundamentals, prevailing concepts as well as current practical applications