This paper considers the general lot sizing and scheduling problem (GLSP) in single level capacitated environments with sequence dependent item changeovers. The proposed model simultaneously determines the production sequence of multiple items with capacity-constrained dynamic demand and lot size to minimize overall costs. First, a mixed-integer programming (MIP) model for the GLSP is developed in order to solve smaller size problems. Afterwards, a matheuristic algorithm that integrates Simulated Annealing (SA) algorithm and the proposed MIP model is devised for solving larger size problems. The proposed matheuristic approach decomposes the GLSP into sub-problems. The proposed SA algorithm plays the controller role. It guides the search process by determining values for some of the decision variables and calls the MIP model to identify the optimal values for the remaining decision variables at each iteration. Extensive numerical experiments on randomly generated test instances are performed in order to evaluate the performance of the proposed matheuristic method. It is observed that the proposed matheuristic based solution method outperforms the MIP and SA, if they are used alone for solving the present GLSP.

In this paper it is presented an improvement of the branch and bound algorithm for the permutation flow shop problem with blocking-in-process and setup times with the objective of minimizing the total flow time and tardiness, which is known to be NP-Hard when there are two or more machines involved. With that objective in mind, a new machine-based lower bound that exploits some structural properties of the problem. A database with 27 classes of problems, varying in number of jobs (n) and number of machines (m) was used to perform the computational experiments. Results show that the algorithm can deal with most of the problems with less than 20 jobs in less than one hour. Thus, the method proposed in this work can solve the scheduling of many applications in manufacturing environments with limited buffers and separated setup times.

This document addresses the problem of scheduling and routing a specific number of vehicles to visit a set of customers in specific time windows during a planning horizon. The vehicles have a homogeneous limited capacity and have their starting point and return in a warehouse or initial node, in addition, multiple variants of the classic VRP vehicle routing problem are considered, where computational complexity increases with the increase in the number of customers to visit, as a characteris-tic of an NP-hard problem. The solution method used consists of two connected phases, the first phase makes the allocation through a mixed-integer linear programming model, from which the visit program and its frequency in a determined plan-ning horizon are obtained. In the second phase, the customers are grouped through an unsupervised learning algorithm, the routing is carried out through an Ant Colony Optimization metaheuristic that includes local heu-ristics to make sure com-pliance with the restrictive factors. Finally, we test our algorithm by performance measures using instances of the literature and a comparative model, and we prove the effectiveness of the proposed algorithm.

We consider a no-wait m-machine flowshop scheduling problem which is common in different manufacturing industries such as steel, pharmaceutical, and chemical. The objective is to minimize total tardiness since it minimizes penalty costs and loss of customer goodwill. We also consider the performance measure of total completion time which is significant in environments where reducing holding cost is important. We consider both performance measures with the objective of minimizing total tardiness subject to the constraint that total completion time is bounded. Given that the problem is NP-hard, we propose an algorithm. We conduct extensive computational experiments to compare the performance of the proposed algorithm with those of three well performing benchmark algorithms in the literature. Computational results indicate that the proposed algorithm reduces the error of the best existing benchmark algorithm by 88% under the same CPU times. The results are confirmed by extensive statistical analysis. Specifically, ANOVA analysis is conducted to justify the difference between the performances of the algorithms, and a test of hypothesis is performed to justify that the proposed algorithm is significantly better than the best existing benchmark algorithm with a significance level of 0.01.

Due to its proactive impact on the serviceability of components in a system, preventive maintenance plays an important role particularly in systems of geographically spread infrastructure such as utilities networks in commercial buildings. What makes such systems differ from the classical schemes is the routing and technicians' travel times. Besides, maintenance in commercial buildings is characterized by its short tasks’ durations and spatial distribution within and between different buildings, a class of problems that has not been suitably investigated. Although it is not trivial to assign particular duties solely to multi-skilled teams under limited time and capacity constraints, the problem becomes more challenging when travel routes, durations and service levels are considered during the execution of the daily maintenance tasks. To address this problem, we propose a Mixed Integer Linear Programming Model that considers the above settings. The model exact solution recommends collaborative choices that include the number of maintenance teams, the selected tasks, routes, tasks schedules, all detailed to days and teams. The model will reduce the cost of labor, replacement parts, penalties on service levels and travel time. The optimization model has been tested using different maintenance scenarios taken from a real maintenance provider in the UAE. Using CPLEX solver, the findings demonstrate an inspiring time utilization, schedules of minimal routing and high service levels using a minimum number of teams. Different travel speeds of diverse assortment of tasks, durations and cost settings have been tested for further sensitivity analysis.

The paradigm of the cyber-physical manufacturing system is playing an increasingly important role in the development of production systems and management of manufacturing processes. This paper presents an optimization model for solving an integrated problem of production planning and manufacturing control. The goal is to create detailed production plans for a complex manufacturing system and to control the skilled manual workers. The detailed optimization model of the problem and the developed approach and algorithms are described in detail. To consider the impact of human workers performing the manufacturing primary operations, we elaborated an extended simulation-based procedure and new multi-criteria control algorithms that can manage varying availability constraints of parallel workstations, worker-dependent processing times, different product types and process plans. The effectiveness of the proposed algorithms is demonstrated by numerical results based on a case study.

In multisite production environments, the appropriate management of production resources is an activity of fundamental relevance to optimally respond to market demands. In particular, each production facility can operate with different policies according to its objectives, prioritizing the quality and standardization of the product, customer service, or the overall efficiency of the system; goals which must be taken into account when planning the production of the entire complex. At the operational level, in order to achieve an efficient operation of the production system, the integrated problem of batching and scheduling must be solved over all facilities, instead of doing it for each plant separately, as has been usual so far. Then, this paper proposes a mixed-integer linear programming model for the multisite batching and scheduling problems, where different operational policies are considered for multiple batch plants. Through two examples, the impact of policies on the decision-making process is shown.

All projects require a structure to meet project requirements and achieve established goals. This framework is called project management. Therefore, project management plays an important role in national development and economic growth. Project management includes various knowledge areas such as project integration management, project scope management, project schedule management, etc. The article focuses on the resource-constrained project scheduling known as problem so- called the resource-constrained project scheduling problem (RCPSP). The RCPSP is a part of schedule management. The standard RCPSP has two important constraints, resource constraints and precedence relationships of activities during project scheduling. The objective of the problem is to optimize and minimize the project duration, subject to the above constraints. In this paper, we develop a convolutional neural network approach to solve the standard single mode RCPSP. The advantage of this algorithm over conventional methods such as metaheuristics is that it does not need to generate many solutions or populations. In this paper, the serial schedule generation scheme (SSGS) is used to schedule the project activities using an evolved convolutional neural network (CNN) as a tool to select an appropriate priority rule to filter out a candidate activity. The evolved CNN learns according to the eight project parameters, namely network complexity, resource factor, resource strength, average work per activity, etc. The above parameters are the inputs of the network and are recalculated at each step of the project planning. Moreover, the developed network has priority rules which are the outputs of the developed neural network. Therefore, after the learning process, the network can automatically select an appropriate priority rule to filter an activity from the eligible activities. In this way, the algorithm is able to schedule all project activities according to the given project constraints. Finally, the performance of the Convolutional Neural Network (CNN) approach is investigated using standard benchmark problems from PSPLIB in comparison to the MLFNN approach and standard metaheuristics.

Transportation planning in forest industry is a challenging activity since it involves complex decisions about raw material allocation, vehicle routing and scheduling of trucks arrivals to both harvest areas and the plants. In the Argentine context, specifically in the Argentinean Northeast (NEA) region, the forest industry plays essential role for the economic development and, among the included activities, the transportation is the key element considering the volumes that must be moved and the distances to be traveled. Therefore, enhancing efficiency in the transportation activity improves significantly the performance of this industry. In this work, a Mixed Integer Linear Programming (MILP) model is presented, where raw material allocation, vehicle routing and scheduling of trucks arrivals are simultaneously addressed. Since the resolution times of the proposed integrated MILP model are prohibitive for large instances, a hierarchical approach is also presented. The considered decomposition approach involves two stages: in the first phase, the raw material allocation and vehicle routing problems are solved through a MILP model, while in the second phase, fixing the route for each truck according to the results of the previous step, the scheduling of truck arrivals to both the harvest areas and the plants is solved through a new MILP model. The obtained results show that the proposed approach is very effective and could be easily applied in this industry.

The Additive Manufacturing (AM) scheduling problem is becoming a very felt issue not only by the scholars but also by the practitioners who are looking to this new technology as a new integrated part of their traditional production systems. They need new scheduling models to adapt the traditional scheduling rules to the changed ones of the additive manufacturing. This paper deals with the enhancement of a scheduling problem for additive manufacturing just present in literature and the presentation of a new meta-heursitic (adapted to the new requirements of the additive manufacturing technology) based on the tabu-search algorithms.