Scheduling Multi-Mode Resource-Constrained Projects Using Heuristic Rules Under Uncertainty Environment

Project scheduling is a key objective of many models and is the proposed method for project planning and management. Project scheduling problems depend on precedence relationships and resource constraints, in addition to some other limitations for achieving a subset of goals. Project scheduling problems are dependent on many limitations, including limitations of precedence relationships, resource constraints, and some other limitations for achieving a subset of goals. Deterministic project scheduling models consider all information about the scheduling problem such as activity durations and precedence relationships information resources available and required, which are known and stable during the implementation process. The concept of deterministic project scheduling conflicts with real situations, in which in many cases, some data on the activity' s durations of the project and the degree of availability of resources change or may have different modes and strategies during the process of project implementation for dealing with multi-mode conditions surrounded by projects and their activity durations. Scheduling the multi-mode resource-constrained project problem is an optimization problem whose minimum project duration subject to the availability of resources is of particular interest to us. We use the multi-mode resource allocation and scheduling model that takes into account the dynamicity features of all parameters, that is, the scheduling process must be flexible to dynamic environment features. In this paper, we propose five priority heuristic rules for scheduling multi-mode resource-constrained projects under dynamicity features for more realistic situations, in which we apply the proposed heuristic rules (PHR) for scheduling multi-mode resource-constrained projects. Five projects are considered test problems for the PHR. The obtained results rendered by these priority rules for the test problems are compared by the results obtained from 10 well-known heuristics rules rendered for the same test problems. The results in many cases of the proposed priority rules are very promising, where they achieve better scheduling dates in many test case problems and the same results for the others. The proposed model is based on the dynamic features for project topography.     

Integrated design of supply chain networks with three echelons, multiple commodities and technology selection

We consider a strategic supply chain design problem with three echelons, multiple commodities and technology selection. We model the problem as a tri-echelon, capacitated facility location problem that decides on the location of plants and warehouses, their capacity and technology planning, the assignment of commodities to plants and the flow of commodities to warehouses and customer zones. We use a mixed-integer programming formulation strengthened by valid but redundant constraints and apply Lagrangean relaxation to decompose the problem by echelon. Lagrangean relaxation provides a lower bound that is calculated using an interior-point cutting plane method. Feasible solutions are generated using a primal heuristic that uses the solution of the subproblems. Unlike common practice in the literature, the decomposition does not aim at getting easy subproblems, but rather at getting subproblems that preserve most of the characteristics of the original problem. Not only does this provide a sharp lower bound but also leads to a simple and efficient primal heuristic. We can afford to have relatively difficult subproblems because the interior-point cutting plane method used to solve the Lagrangean dual makes clever and selective choices of the Lagrangean multipliers leading to fewer calls to the subproblems. Computational results indicate the efficiency of the approach in providing a sharp bound and in generating feasible solutions that are of high quality.     

Vehicle routing concepts in the closed-loop container network of ARN—a case study

In this paper we discuss a real-life case study to optimize the logistics network for the collection of containers from end-of-life vehicle dismantlers in the Netherlands. Advanced planning concepts, such as dynamic assignment of dismantlers to logistic service providers, are analyzed using a simulation model. Based on this model, we periodically solve a vehicle routing problem to gain insight into the long-term performance of the system. The vehicle routing problem considered is a multi-depot pickup and delivery problem with alternative delivery locations. A special characteristic of the problem is the limited vehicle capacity of two containers. We solve this problem with a heuristic based on route generation and set partitioning.     

A heuristic-based approach to integrate the product line selection decision to the supply chain configuration

Product platform development (PPD) as an approach to mass customisation (MC) helps an organisation to reduce costs as well as ensure timely deliveries. Varieties are offered to different market segments by combining and incorporating different modules at different levels. Modules at different levels are essentially features that a customer segment is looking for. It is apparent that overall optimisation would require simultaneous consideration of not only PPD but also other supply chain constraints. In this paper, an attempt has been made to develop a mixed integer linear programming (MILP) model for sourcing, production planning, and PPD decisions. Based on analyses of the model, a heuristic solution procedure has been suggested. The heuristic developed in this paper attempts to decompose the problem and then assimilate the outputs from the simpler parts to obtain the final solution. Finally, a simple example to illustrate the solution procedure is presented.     

Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains

In this paper we address the problem of selecting and scheduling several jobs on a single machine with sequence-dependent setup times and strictly enforced time window constraints on the start time of each job. We use short-term production targets to coordinate decentralised local schedulers and to make the objectives of specific areas in line with the chain objectives by maintaining a desired work in process profile in manufacturing environments. The existing literature in this domain is based on discrete-time approaches. We depart from prior approaches by considering continuous time. We introduce a two-step mathematical programming model based on disjunctive constraints to solve small problems to optimality, and propose an insertion-based heuristic to solve large-scale instances. We provide several variations of the insertion heuristic based on different score functions. The primary objective of these approaches is to maximise the total defined score for jobs while satisfying production targets for families of jobs in each shift. Further, our models minimise the maximum completion time of all selected jobs. The effectiveness, efficiency, and robustness of the proposed algorithms are analysed and compared with the existing literature.     

R&D project selection and scheduling with a filtered beam search approach

Models developed for selecting an optimal portfolio of R&D projects from among a pool of available projects do not generally include project scheduling as part of the selection criteria. Typically after a portfolio of projects is selected according to various selection criteria, they are subsequently scheduled. If it is not possible to schedule the selected projects through various research facilities and/or stages given the available resources, projects may be replaced with others requiring less time, or resources may be increased, which can result in a suboptimal portfolio. In this paper, project scheduling is included in the selection process, with a heuristic filtered beam search approach. Projects are selected on the basis of traditional selection criteria such as expected profits, as well as the makespan of the portfolio. The heuristic search procedure is demonstrated by an in-depth example and computational experimentation.     

Assessing the impact of performance determinants in complex MTO/ETO supply chains through an extended hybrid modelling approach

In make-to-order (MTO)/engineer-to-order (ETO) business environments multiple customer-oriented projects compete for and share resources through interdependent engineering and production activities. Deep knowledge of critical dimensions that affect performance is key in this context. For this, we propose a set of determinants – workload, complexity, outsourcing, design reuse, project type, and knowledge/experience with technology, that impact performance. These determinants are input to an extended hybrid simulation model using system dynamics (SD), discrete event simulation (DES) and agent-based simulation (ABS) that tackles the needs imposed by activities of very different nature, as the project development and manufacturing/assembly operations. The hybrid model is applied to the case of an advanced manufacturing company. Through Monte Carlo sampling, the influence of different combinations of determinants in the performance variability is assessed. A correlation analysis shows evidence of association between all performance determinants and the project time and cost, while no evidence of association between the design reuse and project type determinants and the manufacturing and assembly time.     

Modelling engineering change management in a new product development supply chain

The changes within a new product development (NPD) process are handled differently depending on the stage of the project. The changes during the initial stages of the project are addressed by design iterations, while the changes after the product design is complete are addressed using a formal engineering change management (ECM) process. The ECM process is a complex process, especially under a collaborative environment, where various independent entities work together for a common cause of product development. The interactions between the NPD and ECM processes have rarely been investigated in the research community. In this paper, we attempt to study the interactions between the various NPD and ECM process parameters by modelling the processes and simulated the model to understand the parameter interactions. The organisations in a supply chain have been characterised based on their interactions with the original equipment manufacturer (OEM) during the NPD process. The organisation process templates representing the NPD and ECM processes of each type of organisation in the supply chain have been modelled. The templates have been used to develop a simulation model representing the NPD and ECM processes for a supply chain. The process variables, such as processing rates, resources, resource composition, resource allocation priority, processing quality and phase overlap, have been included in the model. The results indicate that most of the variables and interactions among the variables have a significant influence on the NPD lead time. By identifying the status of?the NPD process, the decision-makers can use these results to develop appropriate management policies to govern their product development projects.     

Process plan selection based on product mix and production volume

Most shops currently maintain a single process plan for each part type manufactured by the shop even when multiple process plans are feasible to produce the part. The use of a static process plan for a part regardless of the product mix and volume robs the shop of production flexibility and efficiency. In this paper, given that multiple process plans for a part exist, a method to determine the best process plan to implement for a part type in a given production scenario defined by a known product mix and volume is addressed. The method selects a set of process plans to implement based on minimizing total material handling and machining time for the part mix and volume. The problem is modelled mathematically and solved using a heuristic algorithm. Experimental results to describe the performance of the algorithm are presented for different production scenarios, problem sizes, and solution strategies.     

Modelling and solution approaches for the interconnected city logistics

Achieving a sustainable delivery of goods in urban areas has become a challenging task for service providers and logistics managers. Under this context, the physical internet (PI) Manifesto offers through its emergent concept of interconnected city logistics (ICL) a solution toward a more sustainable transportation of PI containers within cities. In this article, we explore the operational urban transportation problem of PI containers under ICL considerations. For this variant, built on the multiplicity of urban logistics centres and their interconnection, a comprehensive modelling approach is proposed to include key features such as multiple time periods, multi-zone urban coverage, heterogeneous fleets, multi-trip and multi-hub pickups, and delivery constraints. In order to deal with solvability issues encountered with realistic instances of the problem, a heuristic solution approach is developed. This is done with the objective to come up with solutions offering the best trade-offs between economic and ecological attributes within a short computational time. To validate the approach, a realistic set of instances is built with data inspired from city freight movements in an urban area in France. Using these experiments, the solvability of the model and the performance of our heuristic approach are discussed and managerial insights are derived.     

Objective Project Assignment in an Industrial Engineering Organization

In general, an IE activity within a firm is characterized by resources which may be structured several ways and work activities or projects to which the resources must be allocated. The manager of such an activity is usually required periodically to define and schedule the work he has programmed his organization to engage in for some future finite planning horizon. To accomplish this, the manager must address himself to the problems of selecting an organizational structure, selecting which projects to engage in, and allocating and scheduling his resources to the selected projects. It is in the best interests of the firm that the problems be resolved in an objective manner so as to maximize some selected measure of return to the firm. A mathematical model of this decision process is formulated and then decomposed into a series of subproblems which are cycled through in a circumstantial manner to obtain the optimal solution.     

Projects with sequential iteration: Models and complexity

Many New Product Development (NPD) projects are inherently complex, making effective management of the tasks, resources, and teams necessary to bring new products to market problematic. Frequently, managers of NPD projects are overwhelmed by complicating factors such as stochastic task times, ill-defined specifications, complex interrelationships between tasks, and information dependencies. Recently, an alternative project management tool called the Design Structure Matrix (DSM) that explicitly takes into account the iterative nature of NPD projects has been proposed. In this paper, we first introduce a mixed-integer linear programming formulation for the numerical DSM. Then, we analyze the numerical DSM and establish the complexity of this class of problems. Finally, numerical analysis of the DSM problem and heuristic approaches is presented that shows that relatively good solutions can be easily obtained, thereby offering managers an efficient alternative solution approach to the original DSM problem.     

A new spanning tree-based genetic algorithm for the design of multi-stage supply chain networks with nonlinear transportation costs

The design of configuration and the transportation planning are crucial issues to the effectiveness of multi-stage supply chain networks. The decision makers are interested in the determination the optimal locations of the hubs and the optimal transportation routes to minimize the total costs incurred in the whole system. One may formulate this problem as a 0-1 mixed integer non-linear program though commercial packages are not able to efficiently solve this problem due to its complexity. This study proposes a new spanning tree-based Genetic Algorithm (GA) using determinant encoding for solving this problem. Also, we employ an efficient heuristic that fixes illegal spanning trees existing in the chromosomes obtained from the evolutionary process of the proposed GA. Our numerical experiments demonstrate that the proposed GA outperforms the other previously published GA in the solution quality and convergence rate.     

基于混合智能算法的多资源约束项目优化调度

 基于关键链项目管理(critical chain project management,CCPM),利用一种混合智能优化算法求解多资源约束项目调度问题,解决传统调度优化算法的不足,提高这类问题的求解质量.首先利用一类启发式算法识别项目关键链,并设置缓冲区尺寸,以项目总工期和在制品库存为优化目标建立数学模型,设计一种混合智能优化算法求解,并对项目问题库中的j30hrs.sm问题和某生产型项目进行实验分析,得到优化的结果.实验表明,采用混合智能算法求解这类问题能得到明显优于一般调度优化算法的结果.     

A robust scheduling for the multi-mode project scheduling problem with a given deadline under uncertainty of activity duration

The problem of this paper deals with the multi-mode project scheduling problem under uncertainty of activity duration where only the renewable resources are taken into account and a given deadline has to be met at the cost of recruiting additional resources. A heuristic algorithm is employed to solve this problem, and to maintain the robustness of the baseline schedule, the concept of critical chain project management (CCPM) is applied in which a new definition to resource buffer is considered. A simulation methodology is used to determine the size and location of resource buffers in the schedules in which three different buffer sizes and three different uncertainty levels are considered. Results and analysis of the simulation outcomes illustrate that resource buffers are useful and should be simulated by the CCPM schedules, as they help to decrease the total duration of the project during implementation and meet the deadline of the project with more assurance.     

Product decomposition strategy for optimization of supply chain planning

Optimization of large-scale supply chain planning models requires the application of decomposition strategies to reduce the computational expense. Two major options are to use either spatial or temporal Lagrangean decomposition. In this paper, to further reduce the computational expense a novel decomposition scheme by products is presented. The decomposition is based on a reformulation of knapsack constraints in the problem. The new approach allows for simultaneous decomposition by products and by time periods, enabling the generation of a large number of subproblems, that can be solved by using parallel computing. The case study shows that the proposed product decomposition exhibits similar performance as the temporal decomposition, and that selecting different orders of products and aggregating the linking constraints can improve the efficiency of the algorithm.     

Robust closed-loop global supply chain network design under uncertainty: the case of the medical device industry

Improving performance of global supply chains requires careful consideration of various factors including distance from markets, access to resources, exchange and tax rates, import tariffs, and trade regulations. In this paper, a comprehensive optimization model is proposed to maximise the after-tax profit of a closed-loop global supply chain for medical devices under uncertainty. The uncertainty of the decision-making environment is modelled using the budget of uncertainty concept in interval robust optimization. International financial issues due to the Economic Cooperation Organisation Trade Agreement as well as national regulations including transfer pricing limitations, exchange rates, tax rates, and import tariffs are considered. The proposed model considers various realistic assumptions pertaining to medical device supply chains such as multiple products, multiple periods, multiple echelons, and limited warehousing lifetime. In addition, reverse flows of perished and defective products are considered to address environmental concerns and customers’ requirements as well as to gain economic advantages. To tackle this problem, an efficient memetic algorithm is developed that incorporates adaptive variable neighbourhood search as its local search heuristic. Computational results demonstrate the efficiency of the proposed model in dealing with uncertainty in an agile manufacturing context. In addition, several managerial insights are discussed based on the results.     

Production planning for flexible flow systems with limited machine flexibility

A flexible manufacturing system (FMS) is highly capital-intensive and FMS users are concerned with achieving high system utilization. The production planning function for setting up an FMS prior to production should be developed in order to make the most of the potential benefits of FMSs. We consider two production planning problems of grouping and loading a flexible flow system, which is an important subset of FMSs where the routing of parts is unidirectional. We show that considering this routing restriction as well as limited machine flexibility strongly affects both the solution techniques and the quality of the solutions. Because of the complexity of the problem, we present a heuristic approach that decomposes the original problem into three interrelated subproblems. We show that the proposed approach usually finds a near-optimum solution and is superior to an approach that exists in the literature of FMS production planning. We also introduce effective heuristic methods for two new subproblems that arise because of the unidirectional flow precedence and flexibility constraints. Computational results are reported and future research issues are discussed.     

A systematic review of China’s belt and road initiative: implications for global supply chain management

China’s Belt and Road Initiative (BRI) is one of the world’s largest infrastructure projects, with its potential political and economic impact being widely discussed since its inception in 2013. Yet the phenomenon has received only limited attention in the Supply Chain Management (SCM) literature. In response, we first conduct a broad systematic review of the literature to assess how China’s BRI is portrayed. Using this as a backdrop, we then distil the likely impact of the BRI on location decisions and supply chain flows. Finally, in a broader discussion of the SCM literature, we explore the implications of the BRI for future research in four key areas: supply chain configuration, supply chain resilience, sustainable SCM, and cross border SCM. While these areas are not new, the BRI presents a unique context that can be used to enhance theory and understanding in each area. The BRI reduces time distance independent of geographical distance by diverting supply chain flows from established routes to new routes via far less accessible regions. This introduces new risks and sustainability issues that call for multi-criteria decision support systems. Another important issue is the adoption and diffusion of the BRI since this will ultimately determine project success.     

Project scheduling with flexible resources: formulation and inequalities

In this paper, we study a variant of the resource-constrained project scheduling problem in which resources are flexible, i.e., each resource has several skills. Each activity in the project may need several resources for each required skill. We present a mixed-integer linear programming formulation for this problem. Several sets of additional inequalities are also proposed. Due to the fact that some of the above-mentioned inequalities require a valid upper bound to the problem, a heuristic procedure is proposed. Computational experience is reported based on randomly generated data, showing that for instances of reasonable size the proposed model enlarged with the additional inequalities can be solved efficiently.