Search results

For prefabricated building construction, improper handling of the production scheduling for prefabricated components is one of the main reasons that affect project performance, which causes overspending, schedule overdue and quality issues. Prior research on prefabricated components production schedule has shown that optimizing the flow shop scheduling problem (FSSP) is the basis for solving this issue. However, some key resources and the behavior of the participants in the context of actual prefabricated components production are not considered comprehensively.

This paper characterizes the production scheduling of the prefabricated components problem into a permutation flow shop scheduling problem (PFSSP) with multi-optimization objectives, and limitation on mold and buffers size. The lean construction principles of value-based management (VBM) and just-in-time (JIT) are incorporated into the production process of precast components. Furthermore, this paper applies biogeography-based optimization (BBO) to the production scheduling problem of prefabricated components combined with some improvement measures.

This paper focuses on two specific scenarios: production planning and production rescheduling. In the production planning stage, based on the production factor, this study establishes a multi-constrained and multi-objective prefabricated component production scheduling mathematical model and uses the improved BBO for prefabricated component production scheduling. In the production rescheduling stage, the proposed model allows real-time production plan adjustments based on uncertain events. An actual case has been used to verify the effectiveness of the proposed model and the improved BBO.

With respect to limitations, only linear weighted transformations are used for objective optimization. In regards to research implications, this paper considers the production of prefabricated components in an environment where all parties in the supply chain of prefabricated components participate to solve the production scheduling problem. In addition, this paper creatively applies the improved BBO to the production scheduling problem of prefabricated components. Compared to other algorithms, the results show that the improved BBO show optimized result.

The proposed approach helps prefabricated component manufacturers consider complex requirements which could be used to formulate a more scientific and reasonable production plan. The proposed plan could ensure the construction project schedule and balance the reasonable requirements of all parties. In addition, improving the ability of prefabricated component production enterprises to deal with uncertain events. According to actual production conditions (such as the occupation of mold resources and storage resources of completed components), prefabricated component manufacturers could adjust production plans to reduce the cost and improve the efficiency of the whole prefabricated construction project.

The value of this article is to provide details of the procedures and resource constraints from the perspective of the precast components supply chain, which is closer to the actual production process of prefabricated components. In addition, developing the production scheduling for lean production will be in line with the concept of sustainable development. The proposed lean production scheduling could establish relationships between prefabricated component factory manufacturers, transportation companies, on-site contractors and production workers to reduce the adverse effects of emergencies on the prefabricated component production process, and promote the smooth and efficient operation of construction projects.

Takes the development of a new optimization process for production scheduling and develops it into a systematic‐mathematical algorithm. Tests this algorithm against a simulated production environment and compares the generated schedules against those generated by EOQ, MRP, JIT, and OPT. The result is that bottleneck allocation methodology (BAM), with its critical resource based capacity scheduling out‐performs these other models in an intermittent demand discrete manufacturing environment.

The purpose of this study is to propose a new mathematical model that integrates strategic decision-making with tactical-operational decision-making in order to optimize production and scheduling decisions.

This study presents a multi-objective optimization framework to make production planning, scheduling and maintenance decisions. An epsilon-constraint method is used to solve small instances of the model, while new hybrid optimization algorithms, including multi-objective particle swarm optimization (MOPSO), non-dominated sorting genetic algorithm, multi-objective harmony search and improved multi-objective harmony search (IMOHS) are developed to address the high complexity of large-scale problems.

The computational results demonstrate that the metaheuristic algorithms are effective in obtaining economic solutions within a reasonable computational time. In particular, the results show that the IMOHS algorithm is able to provide optimal Pareto solutions for the proposed model compared to the other three algorithms.

This study presents a new mathematical model that simultaneously determines green production planning and scheduling decisions by minimizing the sum of the total cost, makespan, lateness and energy consumption criteria. Integrating production and scheduling of a shop floor is critical for achieving optimal operational performance in production planning. To the best of the authors' knowledge, the integration of production planning and maintenance has not been adequately addressed.

The purpose of this paper is to present a method for generating a set of feasible, optimized production schedules for the erection process of compact shipyards building complex ship types.

A bi-objective mathematical model is developed based on the process constraints. A Pareto front of possible erection schedules is created using a the Non-dominated Sorting Genetic Algorithm II with a custom heuristic fitness function and constraint violation.

It was possible to consistently generate a wide variety of production schedules with superior performance to those manually created by shipyard planner in negligible computational time.

The set of optimized production schedules generated by the developed methodology can be used as a starting point by existing shipyard planners when drafting the initial erection planning for a new project. This allows the planners to consider wider variety of options in less time.

No other published approach for the automatic generation of optimized production schedules of the erection process is specifically tailored to the construction of complex ships.

Discusses a new manufacturing philosophy, Schedule‐based Manufacturing and compares it to the widely used Manufacturing Resource Planning [MRPII]. Looks at the history of the various manufacturing philosophies and how they have developed. Describes how SBM grew from interactive real‐time shop floor scheduling and outlines its benefits.

The current study aims to propose a new analytical approach by considering energy consumption (EC), maximum tardiness and completion time as the primary objective functions to assess the performance of parallel, non-bottleneck and multitasking machines operating in dynamic job shops.

An analytical and iterative method is presented to optimize a novel dynamic job shop under technical constraints. The machine’s performance is analyzed by considering the setup energy. An optimization model from initial processing until scheduling and planning is proposed, and data sets consisting of design parameters are fed into the model.

Significant variations of EC and tardiness are observed. The minimum EC was calculated to be 141.5 hp.s when the defined decision variables were constantly increasing. Analysis of the optimum completion time has shown that among all studied methods, first come first served (FCFS), earliest due date (EDD) and shortest processing time (SPT) have resulted in the least completion time with a value of 20 s.

Considerable amount of energy can be dissipated when parallel, non-bottleneck and multitasking machines operate in lower-power modes. Additionally, in a dynamic job shop, adjusting the trend and arrangement of decision variables plays a crucial role in enhancing the system’s reliability. Such issues have never caught the attention of scientists for addressing the aforementioned problems. Therefore, with these underlying goals, this paper presents a new approach for evaluating and optimizing the system’s performance, considering different objective functions and technical constraints.

The disjunctive graph is a network representation of the job‐shop scheduling problem, while the longest path problem (LPP) is one of the most important subjects in this research field. This paper aims to study the special topological structure of the disjunctive graph, and proposes a suite of quick value‐setting algorithms for solving the LPPs commonly encountered in job‐shop scheduling.

The topological structure of the disjunctive graph is analyzed, and some properties and propositions regarding LPPs are presented. Subsequently, algorithms are proposed for solving LPPs encountered in job‐shop scheduling.

The proposed algorithms significantly improve the efficiency of the shifting‐bottleneck procedure, making it practicable to realise real‐time scheduling and hence effective operations of modern manufacturing systems.

The paper demonstrates that it is possible to develop very efficient algorithms by imposing a special topological structure on the network.

Building to order enables manufacturing to better respond to market conditions. The time lost between changes in customer preferences and product mix disappears and customer demand can both be anticipated and shaped by the sales system. An automotive build to order supply chain must be able to meet seasonality within markets, and understand the detailed demand volatility for certain elements of the complex product mix, from which much of the profitability is derived. Market responsive manufacturing entails adaptive and flexible production and supply capability in conjunction with real‐time market interaction through revenue management. The combination of late capacity setting and revenue management can enable the whole extended enterprise to operate as a single entity. This article outlines the demand volatility examined for automotive products, integrated revenue and demand management as a solution, and the subsequent order system investment requirements.

The purpose of this paper is to present an integrated strategy for inventory control and preventive maintenance planning for a single-machine production system with increasing failure rates.

There are three scenarios for solving presented model. The strategy is such that the production component is placed under maintenance as soon as it reaches the m level or in the event of a malfunction earlier than m. Maintenance completion time is not predictable. As a result of periodic maintenance, a buffer stock h is held and the production component starts to produce from period A with the maximum throughput to satisfy demand and handle the shortage. A numerical algorithm to find the optimal policy is developed. The algorithm is implemented using MATLAB software.

The authors discovered that joint optimization mainly reduces production system costs. Cs is holding cost of a product unit during a unit of time. The authors consider two values for Cs, consist of, Cs = 1 and Cs = 2. By comparing the two cases, it is concluded that by reducing the cost from Cs = 2 to Cs = 1, the optimal scenario does not differ. The amount of decision variables decreases.

This paper is the provision of a model in which the shortage of back order type is considered, which greatly increases the complexity of the problem compared to similar issues. The methods for solving such problems are provided by the numerical algorithm, and the use of buffers as a way to compensate for the shortage in the event of a complete shutdown of the production line which is a very effective and efficient way to deal with customer loss.

This paper seeks to improve solution procedures for solving a larger version of the integrated preventive maintenance planning and production scheduling model with a total weighted expected tardiness objective function introduced in a 2003 paper by Cassady and Kutanoglu using a genetic algorithm heuristic procedure.

In this paper, heuristics based on genetic algorithms are developed to solve the integrated model.

The performance of the proposed genetic algorithm heuristics are evaluated using multiple instances of several problem sizes. The results indicate that the proposed genetic algorithms can effectively be used to solve the integrated problem.

The heuristics presented in this paper significantly improve the ability of the decision‐maker to consider larger instances of the integrated model. One may ask, “how significant is that improvement?” The answer depends on the specific industrial context under consideration and the definition of a “job”.

Typically, production scheduling and preventive maintenance planning is planned and executed independently in spite of the inter‐dependent relationship between them. However, the 2003 paper by Cassady and Kutanoglu demonstrates the benefit of using the integrated model to solve these two problems simultaneously. However, their solution procedure is limited to small problems (6‐jobs or less). Therefore, this study intends to improve the solution procedure to solve larger instances of the problem.