Loading [MathJax]/jax/element/mml/optable/SuppMathOperators.js

Integrated Optimization Scheduling Model for Ship Outfitting Production with Endogenous Uncertainties

Liu Lijun Cao Pu zhou Yajing Long Zhixin Jiang Zuhua

Lijun Liu, Pu Cao, Yajing zhou, Zhixin Long, Zuhua Jiang (2025). Integrated Optimization Scheduling Model for Ship Outfitting Production with Endogenous Uncertainties. Journal of Marine Science and Application, 24(1): 194-209. https://doi.org/10.1007/s11804-024-00454-x
Citation: Lijun Liu, Pu Cao, Yajing zhou, Zhixin Long, Zuhua Jiang (2025). Integrated Optimization Scheduling Model for Ship Outfitting Production with Endogenous Uncertainties. Journal of Marine Science and Application, 24(1): 194-209. https://doi.org/10.1007/s11804-024-00454-x

Integrated Optimization Scheduling Model for Ship Outfitting Production with Endogenous Uncertainties

https://doi.org/10.1007/s11804-024-00454-x
Funds: 

the High-tech ship scientific research project of the Ministry of Industry and Information Technology of the People's Republic of China, and the National Nature Science Foundation of China 71671113

the Science and Technology Department of Shaanxi Province 2020GY219

the Ministry of Education Collaborative Project of Production, Learning and Research 201901024016

    Corresponding author:

    Lijun LIU liulijun@sust.edu.cn

  • Abstract

    Ship outfitting is a key process in shipbuilding. Efficient and high-quality ship outfitting is a top priority for modern shipyards. These activities are conducted at different stations of shipyards. The outfitting plan is one of the crucial issues in shipbuilding. In this paper, production scheduling and material ordering with endogenous uncertainty of the outfitting process are investigated. The uncertain factors in outfitting equipment production are usually decision-related, which leads to difficulties in addressing uncertainties in the outfitting production workshops before production is conducted according to plan. This uncertainty is regarded as endogenous uncertainty and can be treated as non-anticipativity constraints in the model. To address this problem, a stochastic two-stage programming model with endogenous uncertainty is established to optimize the outfitting job scheduling and raw material ordering process. A practical case of the shipyard of China Merchants Heavy Industry Co., Ltd. is used to evaluate the performance of the proposed method. Satisfactory results are achieved at the lowest expected total cost as the complete kit rate of outfitting equipment is improved and emergency replenishment is reduced.

     

    Article Highlights
    ● A two-stage stochastic programming method is proposed to deal with the endogenous uncertainties in the purchasing and production of outfitting equipment.
    ● The model is completely consistent with the problems encountered during outfitting production in shipyards.
    ● The complete kit rate of outfitting equipment and emergency replenishments are improved under the minimum expected total cost.
  • Outfitting is an essential process in shipbuilding. Outfitting refers to the process of fabricating and installing nonstructural components. The ship outfitting process has three stages, namely, on-unit, on-block, and on-board outfitting. On-unit outfitting refers to the assembly of an interim product consisting of only outfitting materials independent of the hull structure. On-block outfitting refers to the installation of outfitting components, or units, on any structural subassembly or block before its erection on the ways. On-board outfitting refers to the assembly of outfitting materials during hull erection and after launching. On-unit outfitting enhances safety and reduces both required man-hours and durations, which would otherwise be allocated to on-block and on-board outfitting (Dong et al., 2013; Dong et al., 2016). In the outfitting process, various mechanical, electrical, and electronic equipment are manufactured or purchased according to the hull structure (Karanassos, 2016; Wang et al., 2020). In general, this process is fairly chaotic and governed by complex interactions between the geometry of the vessel, time constraints, shipyard layout, building strategy, and different organizations (i. e., shipyard and all involved subcontractors; Rose and Coenen, 2015). Therefore, to minimize the task time and cost for outfitting work, the ideal planning strategy is to finish all of the outfitting work as early as possible. However, as a result of the system disruptions and variations, the delay of other schedules, capacity limitations, technical infeasibility, and the management of an effective system production rate, the ideal outfitting plan is not the reality. Because of unforeseen uncertainties involved in processing times and resource consumptions, as a key element in the manufacturing and purchasing of outfitting equipment, outfitting planning is faced with challenges in improving assembly and complete kit rate. This is one of the most significant challenges encountered in the outfitting production stage of shipbuilding (Dong et al., 2016; Lee et al., 2012). The uncertainties can directly affect the scheduling and replenishment processes and thus need to be considered when making decisions. The degree of autonomy is crucial for scheduling problems to deal with production uncertainties. When disruptions occur, the process is often rescheduled accordingly.

    Solving a complex monolithic problem to optimize a single objective under disruptions specific to scheduling in each period is often impractical. Compared with the simultaneous methods, different objectives stemming from reactive scheduling are readily accommodated by the bi-level programming methods (Sha et al., 2021). The research presented in this paper mainly focused on ship outfitting production and purchasing with endogenous uncertainties and the production scheduling and material ordering involved (Wassick et al., 2012). Stochasticity and periodicity in outfitting equipment purchasing and production are considered in this study. First, the operational management of outfitting is divided into two stages. Then, a two-stage stochastic programming (SP) model with endogenous uncertainty is constructed. Furthermore, production schemes are generated based on the actual production data. Finally, the technique for order of preference by similarity to ideal solution (TOPSIS) method is introduced to select the optimal solution from the multi-production schemes.

    In this study, a two-stage SP method is proposed to deal with the endogenous uncertainties in the purchasing and production of outfitting equipment. The planning process considers the uncertainties of processing time and resource consumption. A two-stage stochastic mixed-integer programming algorithm containing endogenous uncertainty is constructed to deal with the model. The total cost is used as the optimal goal. In addition, the model proposed in this study is completely consistent with the problems encountered during outfitting production in shipyards. The methods and results presented in this study have academic value and potential practical value for outfitting production in shipyards.

    The remainder of the paper is organized as follows: In Section 1, the background and related research work are introduced. In Section 2, the definition of the production scheduling problem of outfitting equipment and the construction of a two-stage SP model are presented. In Section 3, the methodology is discussed in detail. In Section 4, a detailed outfitting scheduling and ordering decision case study is provided. In Section 5, the conclusions and future studies are outlined.

    Traditionally, scheduling and ordering are sequential methods because of different objectives and time scales (Tang et al., 2019). Production scheduling is made by determining the daily and weekly production quantities according to the orders of the customers and is used as the input of the material ordering model. However, such separate models would lead to suboptimal solutions (Lucht et al., 2021). Integrated solutions for scheduling and ordering have long been investigated in manufacturing management. Aquilano and Smith (1980) introduced an integration of project scheduling and material ordering problems (PSMOP) and developed a hybrid model that includes critical path methods and material requirements programming. Smith-Daniels and Aquilano (1984) then proposed an improved heuristic procedure for large-scale project scheduling. Smith-Daniels and Smith-Daniels (1987) proved that an optimal solution can be achieved by decomposing the integration into the derivation of project progress and material batch under certain assumptions. Dodin and Elimam (2001) developed a model that considers different factors, including changes in activity duration, bonuses/penalties due to early/ delayed completion of the project, and procurement quantity discounts. Sajadieh et al. (2009) determined an optimal activity duration and material ordering plan using a metaheuristic algorithm. Najafi et al. (2011) proposed a new optimization model based on the joint replenishment strategy. Tabrizi and Ghaderi (2016) established a bi-objective model with maximum progress robustness and minimum project cost as objectives.

    Because sustainable scheduling is attracting increasing attention from many manufacturing enterprises and energy consumption is a core problem regarding sustainability, the aim is to develop an energy-efficient scheduling method to fulfill material delivery tasks in mixed-model assembly lines (Zhou and Shen, 2018). This scheduling method is required if workers can flexibly fulfill tasks across stations of several lines; thus, the capacity of workers is shared among the lines. Rahman and Nielsen (2019) developed a methodology for scheduling automated transport vehicles to ensure the smooth flow of materials in production and container terminal environments. Elmughrabi et al. (2020) proposed an integrated model for collaborative construction supply chain planning that deals with joint project scheduling and material ordering decisions. Almatroushi et al. (2020) proposed an integrated approach that seeks to jointly optimize project scheduling and material lot sizing decisions for time-constrained project scheduling problems. A mixed-integer linear programming model, which utilizes the splitting of noncritical activities as a means of leveling renewable resources, was devised. Asadujjaman et al. (2021) proposed a mathematical model and solution approach for a resource-constrained PSMOP with discounted cash flows. Because the storage space for materials is often limited in reality in many construction sites, a bi-objective optimization model for the PSMOP with limited storage space is proposed (Zhang and Cui, 2021). Job scheduling incorporated with material ordering can better meet practical needs and lead to overall cost reduction. Sha et al. (2021) presented a stochastic approach for this joint optimization problem, considering uncertainties in job processing times and resource consumption. After the occurrence of major sudden disasters, the dispatching and distribution of disaster relief materials are particularly important; however, in the distribution process, there may be excessive distribution of similar emergency materials, unbalanced distribution volume of relief materials in different disaster-affected points, high distribution cost, and low effective distribution rate. To solve the aforementioned problems, based on the application of big data, Huo and Wang (2022) proposed a three-level network post-disaster material scheduling and distribution model and an improved non-dominated sorting genetic algorithm Ⅱ algorithm.

    The aforementioned studies mostly address the deterministic model of the scheduling and ordering plan (Tabrizi, 2018). However, the integrated model considering uncertainties has not received enough attention. Tabrizi and Ghaderi (2016) solved the procurement scheduling problem of construction projects by considering uncertain task duration and execution cost. They proposed a robust mixed-integer model to describe this problem and applied a metaheuristic algorithm to obtain the solution. To deal with the uncertainty of activity duration, Sha et al. (2021) proposed a two-stage optimization method, which first obtained baseline scheduling by finding a deterministic model and then generated robust scheduling by inserting buffer time. Bruni et al. (2015) presented a multistage SP to solve the uncertainty disclosure sequence of the model. Uncertainties in SP are divided into two categories, namely, exogenous and endogenous uncertainties (Apap and Grossmann, 2017). Several recent studies have considered exogenous uncertainty, which usually refers to market uncertainty, such as price changes, and is independent of production decisions. The SP methods with exogenous uncertainty include stochastic decomposition and stochastic dual dynamic programming (Higle and Sen, 1991; Pereira and Pinto, 1991). In contrast to exogenous uncertainty, endogenous uncertainty has an important impact on the decision-making process. A scenario tree model is used to realize the stochastic process of endogenous uncertainty. A scenario is composed of a series of stages. The scenario tree with endogenous uncertainty is dependent on decision-making, which leads to difficulties in creating models and solving problems. According to Goel and Grossmann (2004), decision-making affects the stochastic process in at least two aspects. The first is that the probability distribution of uncertainty may be changed by the decision, and the second is the uncertainty of revealed time.

    Recently, a polynomial time algorithm, which can identify all redundant non-anticipativity constraints (NACs) in an SP problem with only endogenous uncertainty, has been proposed in the literature. Hooshmand et al. (2018) addressed a new variant of the daily operating room scheduling problem, in which surgeries have stochastic durations and simultaneously considered the initial scheduling and rescheduling decisions within a single optimization model to obtain a more flexible schedule. Zeng et al. (2019) considered large-scale multistage stochastic programs under a specific type of uncertainty, i.e., endogenous uncertainty and developed a general primal bounding framework based on extending the concepts of expected value solution and value of the stochastic solution from multistage stochastic programs under exogenous uncertainties. Bhuiyan et al. (2019) developed a methodology that provides the basis for a decision-making tool to help managers allocate limited cost–share resources among a set of landowners to maximize wildfire risk reduction by implementing a hazardous fuel reduction treatment. Bhuiyan et al. (2020) constructed a resource-constrained decision-maker seeking to optimally allocate protection resources to the facilities and construct links in the network to minimize the expected post-disruption transportation cost. Li and Grossmann (2021) reviewed the basic concepts and recent advances of a risk-neutral mathematical framework called "stochastic programming" and its applications in solving process systems engineering problems under uncertainty. For SP models with latently decision-dependent uncertainty, without any parametric assumption of the latent dependency, Liu et al. (2022) developed a coupled learning-enabled optimization (coherent light emission output) algorithm, in which the learning step of predicting the local dependency and the optimization step of computing a candidate decision are conducted interactively. Leo et al. (2022) addressed the challenge of integrating production planning and maintenance optimization for a process plant. Menon et al. (2021) proposed an integer programming model to solve the problem, whose key feature is that it does not require auxiliary binary variables or explicit NACs to ensure non-anticipativity. Yazdaninejad et al. (2021) presented a new operation optimization approach for an aggregator of distributed energy resources (DERs) considering the unavailability of DERs (as discrete uncertainty sources), as well as forecast uncertainties of electricity prices, solar powers, and wind powers.

    Because multiple products are manufactured in a single period, the outfitting production process needs to be scheduled to meet the production quantities determined by the planning model within a scheduling horizon. Generally, the scheduling horizon is equal to the length of the corresponding planning period. The inputs of the scheduling problem are the production quantities determined by the planning problem. The task processing times are uncertain, which can affect the remaining unscheduled tasks. For example, a prolonged processing time can make the subsequent tasks fail to start at the predetermined time points.

    In this study, a stochastic two-stage programming model with endogenous uncertainty is established to optimize the outfitting job scheduling and raw material ordering process, as shown in Figure 1. The model is treated as a random process. The random variables include job processing time and resource consumption. During the production and processing of ship outfitting parts, the production and procurement planning problem ensures that the production quantities assigned to all periods are fulfilled on time by solving a detailed scheduling problem for every period. Under production uncertainties, successful ful fillment becomes a probabilistic problem. Therefore, this uncertainty is regarded as endogenous uncertainty or decision-related uncertainty in this study. This uncertainty can be treated as NACs in the model. For simplicity, "jobs" is used in this study to refer to production planning jobs that require manufacturing. Each operation involves production tasks of various outfitting equipment, and each task requires different types of renewable and nonrenewable resources. A fixed number of renewable resources are available for production in each period, but nonrenewable resources (outfitting raw materials) need to be purchased and distributed to the outfitting workshop.

    Figure  1  Two-stage production and purchasing model of outfitting equipment
    Download: Full-Size Img

    The uncertain factors of outfitting production are as follows:

    1) Uncertainty of raw materials and resource consumption All assembly jobs in each programming cycle are executed following the assembly plan. The outfitting equipment is finished through the process of warehousing, sorting, assembly, pre-outfitting, and forming the hull structure. The demand time and sequence of outfitting equipment are limited. However, the time and sequence of outfitting equipment requirements are changed if the plan is inaccurate or the production changes. The factors are divided into controllable and uncontrollable factors according to the characteristics of uncertainty. Controllable factors include auxiliary equipment, such as forklifts and flatbed trucks in the shipyard. Reasonable auxiliary equipment scheduling can reduce the impact of arrival time uncertainty. Uncontrollable factors are impossible to predict. These factors include weather, equipment failure, and urgent orders. Therefore, the resource consumption of auxiliary equipment and outfitting raw materials in operations are established as random variables.

    2) Uncertainty of the processing time of outfitting equipment manufacturing

    In the process of outfitting equipment manufacturing, equipment failure, supply delay of raw materials, and worker scheduling operations have a strong impact on processing time.

    (a) Equipment failure. If equipment failure occurs, then maintenance of the mechanical–electrical equipment of the outfitting equipment production line will be time-consuming and difficult.

    (b) Supply delay of raw materials. If the outfitting of raw materials or the upstream semifinished products is not completed on time, then the processing time of the semifinished products will be lengthened.

    3) Uncertainty of the delivery date of outfitting equipment The production tasks for self-made outfitting equipment are categorized into three types, namely, tube, iron, and electric outfitting equipment.

    The delivery time of tube and iron outfitting equipment is determined by the completion time required by the outsourcing and paint shops. The delivery time of electric outfitting equipment is determined by its required completion time. Uncertain factors in the scheduling of outfitting equipment production will lead to the failure of the original scheduling scheme, which will bring additional costs to the production or subsequent operations. The two types of time costs under uncertainty are lead time cost and delay cost. The lead time cost is the cost of outfitting equipment made in advance. Because the shipyard outfields are usually crowded, outfield scheduling will occur if the outfitting equipment is made in advance. To simplify the problem, the cost of outfield scheduling is used as the penalty cost for the outfitting equipment made in advance. By contrast, delayed delivery of materials will increase the assembly cost of outfitting. The delay cost is introduced to refer to the penalty cost of delayed delivery.

    The concept of slack time is presented because of the uncertain delivery date of outfitting equipment. If the delay is within the slack time, then there will be no penalty cost. Otherwise, the cost will be considered based on the delay.

    The main assumptions are as follows:

    Assumption 1: The production plans of the outfitting shop are made according to the capacity limit of the shop inventory.

    Assumption 2: The replenishment lead time of each nonrenewable resource (outfitting raw material) is constant.

    Assumption 3: The inventory holding and shortage costs are linear, and the planning cost is fixed.

    Assumption 4: The uncertainty of raw material delivery time, the processing time of outfitting equipment, and resource consumption will not be fully revealed until the job starts to be processed.

    Assumption 5: A single period is considered in the problem, in which the demands of products are uncertain.

    Assumption 6: The determined production quantities should meet the order demands and the capacity of the production process so the demanded products in every period can be delivered in the current period.

    The first three assumptions simplify the formulation of the joint replenishment process. Assumption 1 is commonly used in dynamic lot sizing problems. Notably, in Assumption 2, replenishment lead time may be related to order quantity in practical applications. Thus, only a constant replenishment lead time is considered in the present study. Assumption 3 guarantees that the replenishment cost function is concave. Assumption 4 explains the progressive revelation of uncertainties. A specific examination will be conducted on each job at its starting time to determine the exact processing time and resource consumption. This updated information will provide an accurate basis for subsequent decision-making.

    The indices and sets used in the model are shown in Table 1. The model parameters are shown in Table 2. The decision variables are shown in Table 3.

    Table  1  Indices and sets
    Indices Sets
    t Time, t = 1, …, T
    J Set of outfitting production planning jobs, J = {1, …, n}
    i Type of pallets, i = {1, …, I}
    v Type of outfitting equipment, v = 1, …, V
    K1 Different kinds of outfitting auxiliary equipment, K1 = {1, …, m1}
    K2 Different kinds of outfitting processing raw materials, K2= {1, …, m2}
    k Type of resource, kK1K2
    ω Future scenario, ωΩ, where Ω is the collection of all future scenarios
    Table  2  Model parameters
    Parameters Definitions
    cjt Cost of starting job j in period t
    ptjω Processing time of job j in scenario ω
    ptjmax Maximum processing time of job j in scenario ω
    aviω Number of outfitting equipment v required for pallets i
    Nvt Indexed set of pallets that requires outfitting equipment v during the period t in the pallets list
    dj Due time of job j
    rjkω Amount of resource k consumed by job j during a period in scenario ω
    Rk1 Initial amount of renewable resource k1 available in the system
    bkt Per-unit shortage cost of resource k in period t
    gk2t Production preparation cost of raw materials k2 processed in the outfitting workshop during t period
    hk2t Per-unit holding cost of raw material k2 in period t
    gvt Processing cost of outfitting equipment v in the outfitting workshop during t period
    hvt Supply hub inventory cost of unit outfitting equipment v during t period
    pω Probability of scenario ω
    IN Warehouse capacity
    Ik2 Initial inventory of raw material k2
    Lk2 Fixed replenishment lead time for outfitting raw material k2
    Lv Fixed replenishment lead time for outfitting equipment v
    M A large number
    Table  3  Decision variables
    Variables Definitions
    xjt Binary variable equal to 1 if job j starts in period t, and 0 otherwise
    zktω Amount of temporary expansion of resource k in time t in scenario ω
    sωk2t Binary variable equal to 1 if there exists replenishment of raw material k2 during time t + Lk2 in scenario ω, and 0 otherwise
    wωk2t Amount of raw material k2 arriving during time t in scenario ω
    inωk2t Inventory of raw material k2 during time t in scenario ω
    inωvt Supply hub inventory of outfitting equipment v during time t in scenario ω

    Formulation (SIOSP):

    minnj=1Tptmaxj+1t=1cjtxjt+ωΩpωQ(x,ω) (1)
     subject to Tptmaxj+1t=1xjt=1,jJ (2)
    Q(x,ω)=minTt=1[m1k1=1bk1tzωk1t+m2k2=1(gk2tsωk2t+bk2tωk2t+hk2tinωk2t)+Vv=1(hvtinωvt+gvtqωvt)] (3)
    zωk1t (4)
    \mathrm{in}_{v, t-1}^\omega+q_{v, t-L_v}^\omega-\sum\limits_{i=N_{v t}}^I a_{v i}^\omega=\operatorname{in}_{v t}^\omega, v=1, \cdots, V ; t=1, 2, \cdots, T (5)
    \begin{gathered} w_{k_2 t}^\omega+z_{k_2 t}^\omega+\mathrm{in}_{k_2, t-1}^\omega=\mathrm{in}_{k_2 t}^\omega+\mathrm{csmp}_{k_2 t}^\omega, \\ \forall k_2 \in K_2, \forall \omega \in \varOmega, t=1, \cdots, T \end{gathered} (6)
    \begin{gathered} -M s_{k_2 t}^\omega+w_{k_2, t+L_{k_2}}^\omega \leqslant 0 \\ \forall k_2 \in K_2, \forall \omega \in \varOmega, t=1, \cdots, T-L_{k_2} \end{gathered} (7)
    \sum\limits_{k_2=1}^{m_2} \mathrm{in}_{k_2 t}^\omega \leqslant \mathrm{INK}, \quad \forall \omega \in \varOmega, t=1, \cdots, T (8)
    \sum\limits_{v=1}^V \mathrm{in}_{v t}^\omega \leqslant \mathrm{INV}, \quad \forall \omega \in \varOmega, t=1, \cdots, T (9)

    NACs:

    Z_t^{\omega \omega^{\prime}}=\sum\limits_{j \in D\left(\omega, \omega^{\prime}\right)} \sum\limits_{\tau=1}^t x_{j \tau}, \quad \forall \omega, \omega^{\prime} \in \varOmega, \omega <\omega^{\prime}, t=1, \cdots, T (10)
    \begin{gathered} M Z_t^{\omega \omega^{\prime}}+s_{k_2 t}^\omega-s_{k_2 t}^{\omega^{\prime}} \geqslant 0, \\ \forall k_2 \in K_2, \forall \omega, \omega^{\prime} \in \varOmega, \omega <\omega^{\prime}, t=1, \cdots, T-L_{k_2} \end{gathered} (11)
    \begin{gathered} M Z_t^{\omega \omega^{\prime}}-s_{k_2 t}^\omega+s_{k_2}^{\omega^{\prime}} \geqslant 0, \\ \forall k_2 \in K_2, \forall \omega, \omega^{\prime} \in \varOmega, \omega <\omega^{\prime}, t=1, \cdots, T-L_{k_2} \end{gathered} (12)
    \begin{gathered} M Z_t^{\omega \omega^{\prime}}+w_{k_2, t+l_{k_2}}^\omega-w_{k_2, t+L_{k_2}}^{\omega^{\prime}} \geqslant 0 \\ \forall k_2 \in K_2, \forall \omega, \omega^{\prime} \in \varOmega, \omega <\omega^{\prime}, t=1, \cdots, T-L_{k_2} \end{gathered} (13)
    \begin{gathered} M Z_t^{\omega \omega^{\prime}}-w_{k_2, t+L_{k_2}}^\omega+w_{k_{k_2}, t+L_{k_2}}^{\omega^{\prime}} \geqslant 0, \\ \forall k_2 \in K_2, \forall \omega, \omega^{\prime} \in \varOmega, \omega <\omega^{\prime}, t=1, \cdots, T-L_{k_2} \end{gathered} (14)
    \begin{gathered} M Z_t^{\omega \omega^{\prime}}+q_{v, t}^\omega-q_{v, t}^{\omega^{\prime}} \geqslant 0, \\ \forall v \in V, \forall \omega, \omega^{\prime} \in \varOmega, \omega <\omega^{\prime}, t=1, \cdots, T \end{gathered} (15)
    \begin{gathered} M Z_t^{\omega \omega^{\prime}}-q_{v, t}^\omega+q_{v, t}^{\omega^{\prime}} \geqslant 0, \\ \forall v \in V, \forall \omega, \omega^{\prime} \in \varOmega, \omega <\omega^{\prime}, t=1, \cdots, T \end{gathered} (16)

    Other constraints:

    w_{k_2 t}^\omega=0, \quad \forall k_2 \in K_2, \forall \omega \in \varOmega, t=1, \cdots, L_{k_2} (17)
    \operatorname{in}_{k_2 t}^\omega=I_{k_2}, \quad \forall k_2 \in K_2, \forall \omega \in \varOmega, t=0 (18)
    \begin{gathered} x_{j t}, s_{k_2 t}^\omega \in\{0, 1\}, w_{k_2 t}^\omega, z_{k_1 t}^\omega, z_{k_2 t}^\omega, \mathrm{in}_{k_2 t}^\omega q_{v t}^\omega, \geqslant 0, \\ \forall j \in J, \forall k_1 \in K_1, \forall k_2 \in K_2, \forall \omega \in \varOmega, t=1, \cdots, T \end{gathered} (19)

    The stochastic version of the integrated ordering and scheduling problem (SIOSP) is used in the present study to solve the two-stage SP model and minimize the expected constraints. The model is described as follows:

    The SIOSP is a multistage SP model aiming to minimize its expected total cost. The objective function (Eq. (1)) is the sum of a deterministic first-stage cost and an expectation of the recourse function Q (x, ω) of subsequent stages. The schedule of jobs (xjt) is determined in the first stage, and x is used to denote the appropriately sized vector corresponding to xjt. The first term in the objective function (Eq. (1)) represents the first-stage job scheduling cost. The term T − ptmaxj + 1 represents the latest start time of job j, which is set to ensure that job j can be completed by time T in all possible scenarios.

    Given the schedule x and each possible scenario ω, the compensatory cost in subsequent stages expressed as recourse function Q (x, ω) in Eq. (3) is optimized. The compensatory decisions include resource expansion quantity (zktω), material replenishment demand variable (sωk2t), raw material ordering quantity (wωk2t), outfitting equipment processing batch (qωvt), and inventory of raw material and outfitting equipment (inωk2t, inωvt) in each period of the planning horizon.

    The compensatory cost expressed in Eq. (3) consists of the temporary renewable resource expansion cost, material setup, shortage and holding costs, and outfitting equipment processing and inventory costs (Wang et al., 2020). The probability of expedited production has been determined by related literature (Ghadimi et al., 2018; Mohammed et al., 2019). Temporary renewable and nonrenewable resources are allowed in the model to expand penalty costs, such as equipment outsourcing or renting. Temporary resource expansion is measured using the variable zktω. If bkt is sufficiently large, then the variable zktω will be equal to 0 in the optimal solution, unless the resource k is inadequeate, which provides decision-makers with insights into which resources are scarce and bottlenecks.

    Constraints (2) and (4) model the scheduling of production auxiliary equipment k1 of shared jobs. Eq. (2) ensures that each job is completed by time T, and Inequation (4) guarantees the availability of resource k1 in any period. Renewable resources of the same type are indistinguishable. Therefore, the tasks that need to be processed are randomly allocated on the idle resources. The right side of Inequation (4) is the resource expansion required by the resource k1 in period t, where csmpω kt is the consumption of resource k in scenario ω in time t. The variable csmpω kt is calculated as follows:

    \begin{gathered} \operatorname{csmp}_{k t}^\omega=\sum\limits_{j=1}^n \sum\limits_{\tau=\max \left(0, t-\mathrm{pt}_j^\omega\right)}^t r_{j k}^\omega x_{j \tau}, \\ \forall k \in K_1 \cup K_2, \forall \omega \in \varOmega, t=1, \cdots, T \end{gathered} (20)

    In Eq. (20), job scheduling item \sum\limits_{\tau=\max \left(0, t-\mathrm{pt}_j^\omega\right)}^t x_{j \tau} is equal to 1 if the job j is processed in time t; otherwise, it is equal to 0.

    Constraints (5) to (9) indicate the material ordering process. Inequation (5) is the inventory equilibrium constraint of the supply hub. Inequation (6) is the buffer inventory equilibrium constraint. Inequation (7) guarantees the storage of raw materials in advance. Inequations (8) and (9) limit the inventory capacity.

    In the model, uncertainties are described by different scenarios. Decisions in different scenarios are linked through unexpected constraints NACs (10) to (16). Unexpected constraints assume that scenarios ω and ω' are indistinguishable in time t. Therefore, for scenarios ω and ω', the compensation decision variables in this period should be the same. If two scenarios are distinguishable, then there is no correlation between two scenarios when making a decision. Set D (ω, ω') ⊆ J is defined to make jD (ω, ω'), and Ztωω' in Eq. (10) is used as an auxiliary variable if and only if the uncertain properties (processing time and resource consumption) of job j are not the same in scenarios ω and ω'. Constraints (10) to (16) indicate that if the jobs that cause scenarios ω and ω' do not start to differ within or before time t (Ztωω' = 0) and there is no information to distinguish between scenarios ω and ω', then sωk2t = sω'k2t and w_{k_2 t, t+L_{k_2}}^\omega=w_{k_2 t, t+L_{k_2}}^{\omega^{\prime}}. If scenarios ω and ω' in time t are distinguishable, then Ztωω' ≥ 1, and Eqs. (9) to (16) will no longer constrain the value of the corresponding decision variable. Notably, Constraints (10) to (16) are symmetrical for the pair of scenarios (ω, ω').

    The numerical example used in this study is generated by combining the actual data from the shipyard of China Merchants Heavy Industry Co., Ltd. with random schemes. The numerical example including two production scenarios ω and ω' is set, which represents the original traditional self-made outfitting equipment production workshop and the new laser center workshop of the shipyard. The conditions of the two workshops are different. Furthermore, the outfitting equipment processing time, resource consumption, and demand for outfitting equipment are different. In the numerical example, a monthly plan is considered. The processing operations of the 12 outfitting equipment (v = 12) required for 5 virtual pallets (i = 5) are divided into 25 planned periods (T = 25) with 30 jobs (J = 30). The corresponding relationships are shown in Table 4.

    Table  4  Relationship table of pallet and outfitting equipment  unit: pcs
    Pallet ID (i) Outfitting equipment ID (v) Demand quantity Job serial number (j)
    UD14C UC14C-WA-PS01 510 Job1
    UD14C UC14C-WA-PS01 510 Job2
    UD14C UC14C-WA-PS01 510 Job3
    UD14C UC14C-WA-PS02 514 Job4
    UD14C UC14C-WA-PS02 514 Job5
    UD14C UC14C-WA-PS03 488 Job6
    UD14C UC14C-WA-PS03 488 Job7
    UD14C UC14C-WA-PS03 488 Job8
    AMD02 AMD02-WA-PS01 506 Job9
    AMD02 AMD02-WA-PS01 506 Job10
    AMD02 AMD02-WA-PS01 506 Job11
    AMD02 AMD02-WA-PS02 464 Job12
    AMD02 AMD02-WA-PS02 464 Job13
    SM18 SM18-WA-PS01 592 Job14
    SM18 SM18-WA-PS01 592 Job15
    SM18 SM18-WA-PS01 592 Job16
    SM18 SM18-WA-PS02 532 Job17
    SM18 SM18-WA-PS02 532 Job18
    SM18 SM18-WA-PS03 584 Job19
    SM18 SM18-WA-PS03 584 Job20
    MM26 MM26-WA-PS01 554 Job21
    MM26 MM26-WA-PS01 554 Job22
    MM26 MM26-WA-PS01 554 Job23
    MM26 MM26-WA-PS02 558 Job24
    MM26 MM26-WA-PS02 558 Job25
    MF21 MF21-WA-PS01 520 Job26
    MF21 MF21-WA-PS01 520 Job27
    MF21 MF21-WA-PS02 492 Job28
    MF21 MF21-WA-PS02 492 Job29
    MF21 MF21-WA-PS02 492 Job30

    Other input data are displayed in Tables 57.

    Table  5  Various costs related to raw materials except (t = 1, k = 3−14)  ×103
    Raw material (k) Production preparation cost (gk) Per-unit holding cost (hk) Per-unit shortage cost (bk)
    3 77 3 1 408
    4 67 3 553
    5 44 5 1 340
    6 57 1 1 300
    7 95 2 163
    8 20 5 1 373
    9 44 4 1 369
    10 66 2 623
    11 64 5 556
    12 25 6 876
    13 15 8 192
    14 86 2 927
    Table  6  Various costs related to outfitting equipment except (t = 1, k = 3−14)  ×103
    Outfitting equipment ID (v) Preparing cost (g) Holding cost (h)
    1 111 59
    2 167 75
    3 164 58
    4 104 86
    5 109 69
    6 121 70
    7 193 61
    8 119 75
    9 174 97
    10 166 99
    11 117 84
    12 180 91
    Table  7  Random variables and initial scheme generation
    Parameters Scheme generation
    Job processing time (pt) U (1, T/5)
    Resource consumption (rjkω) U (1, 50)
    Initial inventory of raw materials (Ik2) 0
    Lead time of raw material purchase (Lk2) U (2, 3)
    Lead time of outfitting equipment production (Lv) U (1, 7)
    Inventory capacity of the buffer (INK) 1 000
    Inventory capacity of the supply hub (INV) 100

    Nine kinds of schemes (m = 1, 2, ⋯, 9) are hypothesized according to the numerical example data. These schemes correspond to different probability combinations (pω, pω') of scenario pairs (ω, ω'). Each scheme is tested 10 times (n = 1, 2, ⋯, 10). The target value (cmn) and model gap (gmn) of each round are recorded in Table 8. The target and average values of the model gap for every scheme are drawn with a double Y-axis cylindrical point line diagram, as shown in Figure 2.

    Figure  2  Comparison diagram of scheme operation results
    Download: Full-Size Img
    Table  8  Experimental results of the numerical examples
    Schemes (m) Scenario pairs (ω, ω') Data Number of experiments (n)
    1 2 3 4 5 6 7 8 9 10
    1 (0.9, 0.1) Target value 799 800 849 244 850 758 849 079 835 913 881 030 895 279 869 931 831 480 799 707
    Gap 2.74% 3.76% 3.09% 2.90% 3.12% 2.77% 2.85% 3.78% 3.55% 3.75%
    2 (0.8, 0.2) Target value 752 199 800 654 752 590 747 486 773 496 790 312 752 234 768 909 801 367 773 657
    Gap 4.22% 3.56% 4.46% 4.06% 4.06% 4.41% 4.94% 4.93% 4.43% 4.60%
    3 (0.7, 0.3) Target value 653 827 606 201 648 563 599 952 579 538 607 173 619 305 631 766 624 497 606 770
    Gap 7.16% 6.38% 5.52% 6.81% 9.07% 7.27% 6.10% 9.50% 9.13% 9.64%
    4 (0.6, 0.4) Target value 599 952 610 330 598 104 582 110 561 472 639 668 582 076 562 138 580 050 589 311
    Gap 6.81% 5.18% 6.93% 6.24% 6.03% 6.09% 6.86% 6.92% 6.44% 6.22%
    5 (0.5, 0.5) Target value 573 967 563 107 557 978 572 637 556 939 537 712 555 935 544 996 577 405 568 589
    Gap 6.67% 6.04% 6.33% 6.12% 6.03% 6.87% 6.87% 6.91% 6.20% 6.75%
    6 (0.4, 0.6) Target value 542 097 570 881 587 294 534 769 535 775 527 119 504 771 545 677 525 532 517 210
    Gap 7.84% 7.47% 7.79% 6.86% 6.63% 7.59% 6.67% 6.60% 7.09% 7.64%
    7 (0.3, 0.7) Target value 618 698 634 170 652 562 605 870 603 825 626 527 602 261 617 953 635 617 630 303
    Gap 4.36% 3.72% 4.90% 4.34% 4.58% 4.56% 4.83% 4.13% 4.69% 4.27%
    8 (0.2, 0.8) Target value 682 161 600 737 642 986 615 636 687 783 685 775 625 490 660 408 653 472 606 126
    Gap 4.94% 6.24% 4.50% 4.60% 4.44% 4.68% 4.78% 4.93% 4.61% 4.72%
    9 (0.1, 0.9) Target value 756 032 738 601 795 482 781 278 788 346 747 846 752 268 758 745 760 459 752 288
    Gap 3.44% 3.99% 3.87% 3.74% 3.73% 3.55% 3.99% 3.73% 3.80% 3.18%

    TOPSIS is used to select the optimal scheme (Bai et al., 2021). The basic principle of the TOPSIS evaluation method is based on the concept of normalizing the evaluation matrix of the original scheme. The best and worst schemes are identified. The distance between the evaluated object and the best scheme and the distance between the evaluated object and the worst scheme are calculated. The relative closeness between the evaluated object and the best scheme is obtained as the basis for evaluating the pros and cons.

    Four evaluation indicators are selected based on the characteristics of outfitting equipment production and the opinions of ship experts. These indicators are total cost, model gap, replenishment frequency, and complete kit rate of outfitting equipment. Four experts from the shipyard brainstormed the methods to assign different weights to the four indicators, as shown in Table 8. The calculation methods of the four indicators are as follows:

    1) Indicators (C) of total cost

    The cost Cm can be obtained by averaging the data from 10 experiments. The calculation formula is expressed as follows:

    C_m=\frac{\sum\limits_{n=1}^{10} c_{m n}}{10} (21)

    2) Indicators (G) of model gap

    The cost Gm can be obtained by averaging the data from 10 experiments. The calculation formula is expressed as follows:

    G_i=\frac{\sum\limits_{j=1}^{10} g_{i j}}{10} (22)

    3) Indicators (B) of replenishment frequency

    The cost Bi can be obtained by averaging the replenishment frequency in 10 experiments. The calculation formula is expressed as follows:

    B_m=\frac{\sum\limits_{\omega=1}^2 \sum\limits_{t=1}^T S_{k_2 t}^\omega}{10} (23)

    4) Indicators (Θ) of the complete kit rate of the outfitting equipment

    The complete kit rate of outfitting equipment is an important indicator that reflects the quality of production. The cost Θi can be obtained by comparing the batch size and demand of the outfitting equipment in 10 experiments. The calculation formula is expressed as follows:

    \Theta_m=\frac{\sum\limits_{\omega=1}^2 \sum\limits_{i=N_{vt}}^I a_{v_i}^\omega-\sum\limits_{t=1}^T q_{v t}}{10 \times \sum\limits_{\omega=1}^2 \sum\limits_{i=N_{v t}}^I a_{v_i}^\omega} (24)

    The data of the four evaluation indicators of each scheme are shown in Table 9.

    Table  9  TOPSIS comprehensive evaluation data
    Scheme (m) Total cost (C) weight = 0.3 Gap (G) weight = 0.1 Replenishment frequency (B) weight = 0.2 Complete set rate (Θ) weight = 0.4
    1 846 222 3.23% 239 91.26%
    2 771 290 4.37% 215 89.67%
    3 617 759 7.66% 220 87.78%
    4 590 521 6.37% 239 83.77%
    5 560 927 6.48% 257 88.14%
    6 539 113 7.22% 227 89.38%
    7 622 779 4.44% 219 90.72%
    8 646 057 4.84% 225 91.23%
    9 763 135 3.70% 241 79.92%

    The TOPSIS method is used to calculate the score and ranking of different schemes according to the previously presented data and weight. The calculation process is as follows:

    1) Data forward processing

    Different characteristics are used in data processing. The data characteristics of the four indicators used in this case and their forward processing method formulas are shown in Table 10.

    Table  10  Data forward processing
    Indicator name Indicator characteristics Forward processing
    Total cost (C) Minimum (cost) indicators \hat{x}_i=\frac{1}{x_i}
    Gap (G)
    Replenishment frequency (B) Maximum (beneficial) indicators No need to process
    Complete set rate (Θ)

    2) Standardized data

    Data standardization is conducted to eliminate the influence of different data index dimensions. In this step, the normalized matrix is standardized, where \boldsymbol{z}_{i j}=\frac{x_{i j}}{\sqrt{\sum\limits_{i=1}^n x_{i j}^2}} the standardized matrix.

    \boldsymbol{Z}=\left(\begin{array}{ccc} z_{11} & \cdots & z_{1 n} \\ \vdots & \ddots & \vdots \\ z_{m 1} & \cdots & z_{m n} \end{array}\right) (25)

    3) Best and worst solution calculations

    Matrix z is scored after the first two steps of normalization and standardization. The best and worst solution vectors, i.e., the largest and smallest numbers in each column, are derived as follows:

    \begin{aligned} \boldsymbol{z}^{+}= & {\left[z_1^{+}, z_2^{+}, \cdots, z_m^{+}\right]=\left[\max \left\{z_{11}, z_{21}, \cdots, z_{n 1}\right\}, \right.} \\ & \max \left\{z_{12}, z_{22}, \cdots, z_{n 2}\right\}, \cdots, \\ & \left.\max \left\{z_{1 m}, z_{2 m}, \cdots, z_{n m}\right\}\right] \end{aligned} (26)
    \begin{aligned} \boldsymbol{z}^{-}= & {\left[z_1^{-}, z_2^{-}, \cdots, z_m^{-}\right]=\left[\min \left\{z_{11}, z_{21}, \cdots, z_{n 1}\right\}, \right.} \\ & \left.\min \left\{z_{12}, z_{22}, \cdots, z_{n 2}\right\}, \cdots, \min \left\{z_{1 m}, z_{2 m}, \cdots, z_{n m}\right\}\right] \end{aligned} (27)

    4) TOPSIS score calculation

    The distance of the ith scheme zi from the best solution is calculated as follows:

    d_i^{+}=\sqrt{\sum\limits_{j=1}^m\left(z_j^{+}-z_{i j}\right)^2} (28)

    The distance of the ith scheme zi from the worst solution is calculated as follows:

    d_i^{-}=\sqrt{\sum\limits_{j=1}^m\left(z_j^{-}-z_{i j}\right)^2} (29)

    A high score for the ith scheme Si indicates a good scheme.

    S_i=\frac{d_i^{-}}{d_i^{+}+d_i^{-}} (30)

    5) Implementation of the TOPSIS algorithm

    The algorithm is designed according to the previously presented calculation process. The results are shown in Table 11 (Akatsu et al., 2020). The results are described in a radar chart, as shown in Figure 3.

    Table  11  TOPSIS comprehensive evaluation results
    Scheme (m) Total cost (C)
    weight = 0.3
    Gap (G
    weight = 0.1
    Replenishment frequency
    (B) weight = 0.2
    Complete set rate (Θ)
    weight = 0.4
    Score Rank
    1 846 222 3.23% 239 91.26% 0.59 4
    2 771 290 4.37% 215 89.67% 0.64 3
    3 617 759 7.66% 220 87.78% 0.46 6
    4 590 521 6.37% 239 83.77% 0.47 5
    5 560 927 6.48% 257 88.14% 0.45 7
    6 539 113 7.22% 227 89.38% 0.51 8
    7 622 779 4.44% 219 90.72% 0.78 1
    8 646 057 4.84% 225 91.23% 0.70 2
    9 763 135 3.70% 241 79.92% 0.52 9
    Figure  3  Comparison diagram of scheme operation results
    Download: Full-Size Img

    The results show that the best scheme is Scheme 7. The scenario probability ratio between the traditional outfitting equipment production workshop and the laser processing center is 3:7. The numerical performance of the four indicators shows that the operation solution in this scheme can achieve a high complete kit rate of outfitting equipment and low total cost. This result is the best choice among the nine schemes. With this combination, the best result is selected to generate the best scheme of self-made outfitting equipment.

    Job scheduling under the best scheme is shown in Table 12 and visually represented by the Gantt chart in Figure 4 (Jia et al., 2007). The production arrangement of outfitting equipment is shown in Table 13 and visually represented by a three-dimensional diagram in Figure 5. The purchasing solution of raw materials is presented in Table 14.

    Table  12  Optimal job scheduling scheme
    Job serial number (j) Job starting time (t) Job processing time
    (pt): ω
    Job completion time
    (pt): ω
    Job processing time
    (pt): ω'
    Job completion time
    (pt): ω'
    Job1 10 4 14 3 13
    Job2 9 2 11 1 10
    Job3 4 3 7 2 6
    Job4 8 3 11 2 10
    Job5 9 3 12 2 11
    Job6 13 3 16 2 15
    Job7 10 2 12 1 11
    Job8 16 4 20 3 19
    Job9 6 3 9 2 8
    Job10 9 2 11 1 10
    Job11 19 4 23 3 22
    Job12 20 4 24 3 23
    Job13 23 3 26 2 25
    Job14 18 4 22 3 21
    Job15 22 4 26 3 25
    Job16 9 2 11 1 10
    Job17 13 3 16 2 15
    Job18 10 2 12 1 11
    Job19 4 3 7 2 6
    Job20 9 3 12 2 11
    Job21 3 4 7 3 6
    Job22 16 4 20 3 19
    Job23 5 2 7 1 6
    Job24 1 3 4 2 3
    Job25 20 2 22 1 21
    Job26 9 3 12 2 11
    Job27 9 2 11 1 10
    Job28 9 3 12 2 11
    Job29 5 2 7 1 6
    Job30 4 3 7 2 6
    Figure  4  Job scheduling Gantt chart
    Download: Full-Size Img
    Table  13  Production and processing arrangement of optimal outfitting equipment schemes (except v = 1‒4)
    Outfitting equipment (v) Time (t) Processing batch (q): ω = 1 Processing batch (q): ω = 2 Outfitting equipment (v) Time (t) Processing batch (q): ω = 1 Processing batch (q): ω = 2
    1 1 11 11 3 1 13 13
    1 2 16 6 3 2 5 0
    1 3 18 14 3 3 6 2
    1 4 20 16 3 4 11 7
    1 5 5 1 3 5 17 13
    1 6 18 14 3 6 18 14
    1 7 16 12 3 7 5 1
    1 8 17 10 3 8 16 12
    1 9 1 0 3 9 7 3
    1 10 9 5 3 10 16 12
    1 11 10 6 3 11 9 5
    1 12 7 3 3 12 14 10
    1 13 19 15 3 13 13 9
    1 14 10 6 3 14 13 9
    1 15 15 11 3 15 20 16
    1 16 19 15 3 16 9 5
    1 17 6 2 3 17 5 1
    1 18 11 7 3 18 13 9
    1 19 11 7 3 19 18 14
    2 1 9 9 3 20 5 1
    2 2 20 12 3 21 18 14
    2 3 6 2 4 2 8 4
    2 4 16 12 4 3 6 2
    2 5 9 5 4 4 19 15
    2 6 15 11 4 5 15 11
    2 7 12 8 4 6 9 5
    2 8 20 16 4 7 5 1
    2 9 8 4 4 8 20 16
    2 10 18 14 4 9 5 1
    2 11 16 8 4 10 8 4
    2 13 11 7 4 11 7 3
    2 14 7 3 4 12 13 9
    2 15 16 12 4 13 20 16
    2 16 10 6 4 14 7 3
    2 17 12 8 4 15 14 10
    2 18 22 18 4 16 17 13
    2 19 4 0 4 17 15 11
    2 20 14 10 4 18 11 7
    2 21 11 7 4 19 5 1
    2 22 12 8 4 20 12 8
    2 23 13 9 4 21 19 15
    Figure  5  Batch diagram of outfitting equipment processing
    Download: Full-Size Img
    Table  14  Purchase of raw materials for the optimal outfitting equipment schemes (except v = 0‒10)
    Raw materials (k) Time (t) Order quantity (z): ω Raw materials (k) Time (t) Order quantity (z): ω
    3 10 78 13 10 36
    4 10 96 14 10 39
    5 10 31 15 10 35
    7 5 31 16 6 43
    7 7 62 16 7 86
    14 8 48 17 6 123
    15 9 44 18 5 39
    47 9 93 18 7 78
    48 9 38 28 8 74
    48 10 76 29 9 93
    49 9 78 30 9 82
    49 10 78 58 9 58
    51 10 78 59 9 80
    52 4 47 60 9 76
    52 5 94 62 10 78
    62 4 105 63 4 76

    In the case of the shipyard of China Merchants Heavy Industry Co., Ltd., the total cost under the current scheduling scheme, which consists of three parts: job scheduling cost, temporary renewable resource expansion cost, and nonrenewable resource (material) supplement cost, is 877 630. Then, the total cost under the optimal scheduling scheme is 622 779 based on the integrated optimization scheduling model of ship outfitting production with endogenous uncertainty. Notably, the total cost under the optimal scheduling scheme has been reduced by approximately 29.05% compared with the total cost under the original scheduling scheme. The value of optimal scheduling models in reducing costs, i. e., practical benefits, such as more efficient production processes, better product quality, and more efficient resource utilization, is achieved. In addition, optimal scheduling can achieve a higher material completion rate and fewer replenishment times while reducing total costs.

    The numerical calculation experiment shows that the production arrangement (the scheme probability ratio between the traditional outfitting equipment production workshop and the laser processing center is 3:7) has the highest comprehensive evaluation value in the schemes with different probabilities. Compared with other scheme settings, this scheme has a high outfitting complete kit rate and fewer temporary replenishment times under the condition of low expected total cost. The generation of the scheme can provide constructive suggestions for production in the shipyards of China Merchants Heavy Industry Co., Ltd.

    In addition, the uncertainty of the environmental scene is introduced in the model, which makes it possible to improve the prediction of future trends and make the best production decision on the environmental uncertainty of future shipbuilding outfitting production. In this solution, the smaller the gap value of the scheme, the fewer replenishment times corresponding to it. The higher outfitting complete kit rate is also obtained. Furthermore, according to the replenishment decision of the optimal scheme, the replenishment frequency is an optimization of the inventory, which ensures a high inventory turnover rate, reduces the risk of shortage, avoids the impact of ship manufacturing delivery time, and improves the actual ship manufacturing benefits.

    In this research, an integrated optimization model of production scheduling and material ordering of outfitting is proposed for practical application in the shipbuilding industry. For the endogenous uncertainty in the production process of outfitting manufacturing, the corresponding scenario probability variables are set and added to the model, and the results are used to guide the processing of outfitting manufacturing and material purchasing of shipyards.

    In this section, experiments are conducted to test the performance of the proposed method. To test the performance of the algorithm, this study creates five test instance classes. The instance classes are represented by (A, B), where A is the number of jobs and B is the number of periods (Sha et al., 2021).

    In each instance class, 10 test instances are randomly generated. The performance of the proposed branch and bound (B&B) algorithm and heuristic approximate (HA) algorithm is compared with that of Commercial SoPlex (CPLEX). Depending on the characteristics of each solution approach, different criteria are used in the computational experiments. The CPLEX terminates if the running time limit of 7 200 s is exceeded or the optimality gap becomes smaller than 5% (Keller and Bayraksan, 2009). The computational results are reported in Table 15. Each entry in Table 15 is the average of the corresponding results over all 10 test instances in each instance class. B & B provides a higher solution accuracy within a shorter running time. B & Bojb is the objective function value obtained by B & B. The last \frac{\mathrm{HA}_{\mathrm{ojb}}-\mathrm{B} \& \mathrm{~B}_{\mathrm{ojb}}}{\mathrm{~B} \& \mathrm{~B}_{\mathrm{ojb}}} shows that the optimization approach significantly reduces the total cost compared with the traditional HA approach.

    Table  15  Performance of the proposed method
    Instance TimeB&B GapB&B (%) TimeHA \frac{\mathrm{HA}_{\mathrm{ojb}}-\mathrm{B} \& \mathrm{~B}_{\mathrm{ojb}}}{\mathrm{~B} \& \mathrm{~B}_{\mathrm{ojb}}} (%)
    (4, 20) 3 867.23 1.98 4 012.80 5.43
    (5, 20) 4 613.37 2.45 4 892.19 4.87
    (6, 20) 5 542.89 3.01 5 839.21 6.19
    (7, 20) 6 652.13 3.92 6 910.58 6.34
    (8, 20) 7 109.37 4.86 7 199.99 5.81

    This study investigated the bidirectional connection between purchase planning and production scheduling of outfitting. The existing shipbuilding production planning process has difficulty in realizing a methodology that connects purchase planning with production scheduling because of the endogenous uncertainty of each planning stage and the lack of an appropriate algorithm. In this study, the authors present a novel two-stage SP model based on the integration optimization of outfitting production scheduling and material ordering with endogenous uncertainty.

    The ideal gap generated by the integrated optimization model can be used as the best solution to guide enterprises to generate new outfitting production and procurement plans and solve the material ordering and job scheduling problems with uncertain processing time and resource consumption. The complete kit rate of outfitting equipment and emergency replenishments are improved under the minimum expected total cost. Simultaneously, the generation of the scheme can provide constructive guidance for actual production in the shipyard, considerably improve the production efficiency of the shipbuilding industry, and reduce costs.

    The limitations of this study can provide directions for future study. First, additional studies are required for the comprehensive integration and development of shipbuilding production planning. Second, existing optimization algorithms and recent reinforcement learning should be applied. In addition, because of practical limitations, this study could only conduct a case study for a single shipyard. In the future, the methodology verified through this study will be used to conduct a plan integration study of other large shipyards.

    Acknowledgement: The authors would like to express their gratitude to the China Merchants Heavy Industry Co., Ltd. and Shanghai Waigaoqiao Shipbuilding Co., Ltd.
    Competing interest The authors have no competing interests to declare that are relevant to the content of this article.
  • Figure  1   Two-stage production and purchasing model of outfitting equipment

    Download: Full-Size Img

    Figure  2   Comparison diagram of scheme operation results

    Download: Full-Size Img

    Figure  3   Comparison diagram of scheme operation results

    Download: Full-Size Img

    Figure  4   Job scheduling Gantt chart

    Download: Full-Size Img

    Figure  5   Batch diagram of outfitting equipment processing

    Download: Full-Size Img

    Table  1   Indices and sets

    Indices Sets
    t Time, t = 1, …, T
    J Set of outfitting production planning jobs, J = {1, …, n}
    i Type of pallets, i = {1, …, I}
    v Type of outfitting equipment, v = 1, …, V
    K1 Different kinds of outfitting auxiliary equipment, K1 = {1, …, m1}
    K2 Different kinds of outfitting processing raw materials, K2= {1, …, m2}
    k Type of resource, kK1K2
    ω Future scenario, ωΩ, where Ω is the collection of all future scenarios

    Table  2   Model parameters

    Parameters Definitions
    cjt Cost of starting job j in period t
    ptjω Processing time of job j in scenario ω
    ptjmax Maximum processing time of job j in scenario ω
    aviω Number of outfitting equipment v required for pallets i
    Nvt Indexed set of pallets that requires outfitting equipment v during the period t in the pallets list
    dj Due time of job j
    rjkω Amount of resource k consumed by job j during a period in scenario ω
    Rk1 Initial amount of renewable resource k1 available in the system
    bkt Per-unit shortage cost of resource k in period t
    gk2t Production preparation cost of raw materials k2 processed in the outfitting workshop during t period
    hk2t Per-unit holding cost of raw material k2 in period t
    gvt Processing cost of outfitting equipment v in the outfitting workshop during t period
    hvt Supply hub inventory cost of unit outfitting equipment v during t period
    pω Probability of scenario ω
    IN Warehouse capacity
    Ik2 Initial inventory of raw material k2
    Lk2 Fixed replenishment lead time for outfitting raw material k2
    Lv Fixed replenishment lead time for outfitting equipment v
    M A large number

    Table  3   Decision variables

    Variables Definitions
    xjt Binary variable equal to 1 if job j starts in period t, and 0 otherwise
    zktω Amount of temporary expansion of resource k in time t in scenario ω
    sωk2t Binary variable equal to 1 if there exists replenishment of raw material k2 during time t + Lk2 in scenario ω, and 0 otherwise
    wωk2t Amount of raw material k2 arriving during time t in scenario ω
    inωk2t Inventory of raw material k2 during time t in scenario ω
    inωvt Supply hub inventory of outfitting equipment v during time t in scenario ω

    Table  4   Relationship table of pallet and outfitting equipment  unit: pcs

    Pallet ID (i) Outfitting equipment ID (v) Demand quantity Job serial number (j)
    UD14C UC14C-WA-PS01 510 Job1
    UD14C UC14C-WA-PS01 510 Job2
    UD14C UC14C-WA-PS01 510 Job3
    UD14C UC14C-WA-PS02 514 Job4
    UD14C UC14C-WA-PS02 514 Job5
    UD14C UC14C-WA-PS03 488 Job6
    UD14C UC14C-WA-PS03 488 Job7
    UD14C UC14C-WA-PS03 488 Job8
    AMD02 AMD02-WA-PS01 506 Job9
    AMD02 AMD02-WA-PS01 506 Job10
    AMD02 AMD02-WA-PS01 506 Job11
    AMD02 AMD02-WA-PS02 464 Job12
    AMD02 AMD02-WA-PS02 464 Job13
    SM18 SM18-WA-PS01 592 Job14
    SM18 SM18-WA-PS01 592 Job15
    SM18 SM18-WA-PS01 592 Job16
    SM18 SM18-WA-PS02 532 Job17
    SM18 SM18-WA-PS02 532 Job18
    SM18 SM18-WA-PS03 584 Job19
    SM18 SM18-WA-PS03 584 Job20
    MM26 MM26-WA-PS01 554 Job21
    MM26 MM26-WA-PS01 554 Job22
    MM26 MM26-WA-PS01 554 Job23
    MM26 MM26-WA-PS02 558 Job24
    MM26 MM26-WA-PS02 558 Job25
    MF21 MF21-WA-PS01 520 Job26
    MF21 MF21-WA-PS01 520 Job27
    MF21 MF21-WA-PS02 492 Job28
    MF21 MF21-WA-PS02 492 Job29
    MF21 MF21-WA-PS02 492 Job30

    Table  5   Various costs related to raw materials except (t = 1, k = 3−14)  ×103

    Raw material (k) Production preparation cost (gk) Per-unit holding cost (hk) Per-unit shortage cost (bk)
    3 77 3 1 408
    4 67 3 553
    5 44 5 1 340
    6 57 1 1 300
    7 95 2 163
    8 20 5 1 373
    9 44 4 1 369
    10 66 2 623
    11 64 5 556
    12 25 6 876
    13 15 8 192
    14 86 2 927

    Table  6   Various costs related to outfitting equipment except (t = 1, k = 3−14)  ×103

    Outfitting equipment ID (v) Preparing cost (g) Holding cost (h)
    1 111 59
    2 167 75
    3 164 58
    4 104 86
    5 109 69
    6 121 70
    7 193 61
    8 119 75
    9 174 97
    10 166 99
    11 117 84
    12 180 91

    Table  7   Random variables and initial scheme generation

    Parameters Scheme generation
    Job processing time (pt) U (1, T/5)
    Resource consumption (rjkω) U (1, 50)
    Initial inventory of raw materials (Ik2) 0
    Lead time of raw material purchase (Lk2) U (2, 3)
    Lead time of outfitting equipment production (Lv) U (1, 7)
    Inventory capacity of the buffer (INK) 1 000
    Inventory capacity of the supply hub (INV) 100

    Table  8   Experimental results of the numerical examples

    Schemes (m) Scenario pairs (ω, ω') Data Number of experiments (n)
    1 2 3 4 5 6 7 8 9 10
    1 (0.9, 0.1) Target value 799 800 849 244 850 758 849 079 835 913 881 030 895 279 869 931 831 480 799 707
    Gap 2.74% 3.76% 3.09% 2.90% 3.12% 2.77% 2.85% 3.78% 3.55% 3.75%
    2 (0.8, 0.2) Target value 752 199 800 654 752 590 747 486 773 496 790 312 752 234 768 909 801 367 773 657
    Gap 4.22% 3.56% 4.46% 4.06% 4.06% 4.41% 4.94% 4.93% 4.43% 4.60%
    3 (0.7, 0.3) Target value 653 827 606 201 648 563 599 952 579 538 607 173 619 305 631 766 624 497 606 770
    Gap 7.16% 6.38% 5.52% 6.81% 9.07% 7.27% 6.10% 9.50% 9.13% 9.64%
    4 (0.6, 0.4) Target value 599 952 610 330 598 104 582 110 561 472 639 668 582 076 562 138 580 050 589 311
    Gap 6.81% 5.18% 6.93% 6.24% 6.03% 6.09% 6.86% 6.92% 6.44% 6.22%
    5 (0.5, 0.5) Target value 573 967 563 107 557 978 572 637 556 939 537 712 555 935 544 996 577 405 568 589
    Gap 6.67% 6.04% 6.33% 6.12% 6.03% 6.87% 6.87% 6.91% 6.20% 6.75%
    6 (0.4, 0.6) Target value 542 097 570 881 587 294 534 769 535 775 527 119 504 771 545 677 525 532 517 210
    Gap 7.84% 7.47% 7.79% 6.86% 6.63% 7.59% 6.67% 6.60% 7.09% 7.64%
    7 (0.3, 0.7) Target value 618 698 634 170 652 562 605 870 603 825 626 527 602 261 617 953 635 617 630 303
    Gap 4.36% 3.72% 4.90% 4.34% 4.58% 4.56% 4.83% 4.13% 4.69% 4.27%
    8 (0.2, 0.8) Target value 682 161 600 737 642 986 615 636 687 783 685 775 625 490 660 408 653 472 606 126
    Gap 4.94% 6.24% 4.50% 4.60% 4.44% 4.68% 4.78% 4.93% 4.61% 4.72%
    9 (0.1, 0.9) Target value 756 032 738 601 795 482 781 278 788 346 747 846 752 268 758 745 760 459 752 288
    Gap 3.44% 3.99% 3.87% 3.74% 3.73% 3.55% 3.99% 3.73% 3.80% 3.18%

    Table  9   TOPSIS comprehensive evaluation data

    Scheme (m) Total cost (C) weight = 0.3 Gap (G) weight = 0.1 Replenishment frequency (B) weight = 0.2 Complete set rate (Θ) weight = 0.4
    1 846 222 3.23% 239 91.26%
    2 771 290 4.37% 215 89.67%
    3 617 759 7.66% 220 87.78%
    4 590 521 6.37% 239 83.77%
    5 560 927 6.48% 257 88.14%
    6 539 113 7.22% 227 89.38%
    7 622 779 4.44% 219 90.72%
    8 646 057 4.84% 225 91.23%
    9 763 135 3.70% 241 79.92%

    Table  10   Data forward processing

    Indicator name Indicator characteristics Forward processing
    Total cost (C) Minimum (cost) indicators \hat{x}_i=\frac{1}{x_i}
    Gap (G)
    Replenishment frequency (B) Maximum (beneficial) indicators No need to process
    Complete set rate (Θ)

    Table  11   TOPSIS comprehensive evaluation results

    Scheme (m) Total cost (C)
    weight = 0.3
    Gap (G
    weight = 0.1
    Replenishment frequency
    (B) weight = 0.2
    Complete set rate (Θ)
    weight = 0.4
    Score Rank
    1 846 222 3.23% 239 91.26% 0.59 4
    2 771 290 4.37% 215 89.67% 0.64 3
    3 617 759 7.66% 220 87.78% 0.46 6
    4 590 521 6.37% 239 83.77% 0.47 5
    5 560 927 6.48% 257 88.14% 0.45 7
    6 539 113 7.22% 227 89.38% 0.51 8
    7 622 779 4.44% 219 90.72% 0.78 1
    8 646 057 4.84% 225 91.23% 0.70 2
    9 763 135 3.70% 241 79.92% 0.52 9

    Table  12   Optimal job scheduling scheme

    Job serial number (j) Job starting time (t) Job processing time
    (pt): ω
    Job completion time
    (pt): ω
    Job processing time
    (pt): ω'
    Job completion time
    (pt): ω'
    Job1 10 4 14 3 13
    Job2 9 2 11 1 10
    Job3 4 3 7 2 6
    Job4 8 3 11 2 10
    Job5 9 3 12 2 11
    Job6 13 3 16 2 15
    Job7 10 2 12 1 11
    Job8 16 4 20 3 19
    Job9 6 3 9 2 8
    Job10 9 2 11 1 10
    Job11 19 4 23 3 22
    Job12 20 4 24 3 23
    Job13 23 3 26 2 25
    Job14 18 4 22 3 21
    Job15 22 4 26 3 25
    Job16 9 2 11 1 10
    Job17 13 3 16 2 15
    Job18 10 2 12 1 11
    Job19 4 3 7 2 6
    Job20 9 3 12 2 11
    Job21 3 4 7 3 6
    Job22 16 4 20 3 19
    Job23 5 2 7 1 6
    Job24 1 3 4 2 3
    Job25 20 2 22 1 21
    Job26 9 3 12 2 11
    Job27 9 2 11 1 10
    Job28 9 3 12 2 11
    Job29 5 2 7 1 6
    Job30 4 3 7 2 6

    Table  13   Production and processing arrangement of optimal outfitting equipment schemes (except v = 1‒4)

    Outfitting equipment (v) Time (t) Processing batch (q): ω = 1 Processing batch (q): ω = 2 Outfitting equipment (v) Time (t) Processing batch (q): ω = 1 Processing batch (q): ω = 2
    1 1 11 11 3 1 13 13
    1 2 16 6 3 2 5 0
    1 3 18 14 3 3 6 2
    1 4 20 16 3 4 11 7
    1 5 5 1 3 5 17 13
    1 6 18 14 3 6 18 14
    1 7 16 12 3 7 5 1
    1 8 17 10 3 8 16 12
    1 9 1 0 3 9 7 3
    1 10 9 5 3 10 16 12
    1 11 10 6 3 11 9 5
    1 12 7 3 3 12 14 10
    1 13 19 15 3 13 13 9
    1 14 10 6 3 14 13 9
    1 15 15 11 3 15 20 16
    1 16 19 15 3 16 9 5
    1 17 6 2 3 17 5 1
    1 18 11 7 3 18 13 9
    1 19 11 7 3 19 18 14
    2 1 9 9 3 20 5 1
    2 2 20 12 3 21 18 14
    2 3 6 2 4 2 8 4
    2 4 16 12 4 3 6 2
    2 5 9 5 4 4 19 15
    2 6 15 11 4 5 15 11
    2 7 12 8 4 6 9 5
    2 8 20 16 4 7 5 1
    2 9 8 4 4 8 20 16
    2 10 18 14 4 9 5 1
    2 11 16 8 4 10 8 4
    2 13 11 7 4 11 7 3
    2 14 7 3 4 12 13 9
    2 15 16 12 4 13 20 16
    2 16 10 6 4 14 7 3
    2 17 12 8 4 15 14 10
    2 18 22 18 4 16 17 13
    2 19 4 0 4 17 15 11
    2 20 14 10 4 18 11 7
    2 21 11 7 4 19 5 1
    2 22 12 8 4 20 12 8
    2 23 13 9 4 21 19 15

    Table  14   Purchase of raw materials for the optimal outfitting equipment schemes (except v = 0‒10)

    Raw materials (k) Time (t) Order quantity (z): ω Raw materials (k) Time (t) Order quantity (z): ω
    3 10 78 13 10 36
    4 10 96 14 10 39
    5 10 31 15 10 35
    7 5 31 16 6 43
    7 7 62 16 7 86
    14 8 48 17 6 123
    15 9 44 18 5 39
    47 9 93 18 7 78
    48 9 38 28 8 74
    48 10 76 29 9 93
    49 9 78 30 9 82
    49 10 78 58 9 58
    51 10 78 59 9 80
    52 4 47 60 9 76
    52 5 94 62 10 78
    62 4 105 63 4 76

    Table  15   Performance of the proposed method

    Instance TimeB&B GapB&B (%) TimeHA \frac{\mathrm{HA}_{\mathrm{ojb}}-\mathrm{B} \& \mathrm{~B}_{\mathrm{ojb}}}{\mathrm{~B} \& \mathrm{~B}_{\mathrm{ojb}}} (%)
    (4, 20) 3 867.23 1.98 4 012.80 5.43
    (5, 20) 4 613.37 2.45 4 892.19 4.87
    (6, 20) 5 542.89 3.01 5 839.21 6.19
    (7, 20) 6 652.13 3.92 6 910.58 6.34
    (8, 20) 7 109.37 4.86 7 199.99 5.81
  • Akatsu S, Masuda A, Shida T, Tsuda K (2020) A study of quality indicator model of large-scale open source software projects for adoption decision-making. Procedia Computer Science 176: 3665–3672. DOI:https://doi.org/ 10.1016/j.procs.2020.09.020
    Almatroushi H, Hariga M, As'Ad R, Al-Bar AR (2020) The multi resource leveling and materials procurement problem: an integrated approach. Engineering Construction & Architectural Management 27(9): 2135–2161. DOI:https://doi.org/ 10.1108/ECAM-10-2019-0563
    Apap RM, Grossmann IE (2017) Models and computational strategies for multistage stochastic programming under endogenous and exogenous uncertainties. Computers and Chemical Engineering 103: 233–274. DOI:https://doi.org/ 10.1016/j.compchemeng.2016.11.011
    Aquilano NJ, Smith DE (1980) A formal set of algorithms for project scheduling with critical path scheduling/material requirements planning. Journal of Operations Management 1(2): 57–67. DOI: 10.1016/0272-6963(80)90013-3
    Asadujjaman M, Rahman HF, Chakrabortty RK, Ryan MJ (2021) Resource constrained project scheduling and material ordering problem with discounted cash flows. Computers and Industrial Engineering 158: 107427. DOI: 10.1016/j.cie.2021.107427
    Bai S, Zhang Y, Li L, Shan N, Chen X (2021) Effective link prediction in multiplex networks: A TOPSIS method. Expert Systems with Applications 177: 114973. DOI:https://doi.org/ 10.1016/j.eswa.2021.114973
    Bhuiyan TH, Medal HR, Harun S (2020) A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption. European Journal of OperationalResearch 285(2): 670–694. DOI: 10.1016/j.ejor.2020.02.016
    Bhuiyan TH, Moseley MC, Medal HR, Rashidi E, Grala RK (2019) A stochastic programming model with endogenous uncertainty for incentivizing fuel reduction treatment under uncertain landowner behavior. European Journal of Operational Research 277(2): 699–718. DOI:https://doi.org/ 10.1016/j.ejor.2019.03.003
    Bruni ME, Beraldi P, Conforti D (2015) A stochastic programming approach for operating theatre scheduling under uncertainty. IMA Journal of Management Mathematics 26(1): 99–119. DOI:https://doi.org/ 10.1093/imaman/dpt027
    Dodin B, Elimam AJIT (2001) Integrated project scheduling and material planning with variable activity duration and rewards 33(11): 1005–1018. DOI: https://doi.org/10.1023/A:1010994519405
    Dong F, Deglise-Hawkinson J, Oyen MPV, Singer DJ (2013) Analytical approach to a two-stage queuing network for the planning of outfitting processes in shipbuilding. Journal of Ship Production and Design 29(3): 136–141. DOI:https://doi.org/ 10.5957/JSPD.29.3.120062
    Dong F, Deglise-Hawkinson JR, Oyen MPV, Singer DJ (2016) Dynamic control of a closed two-stage queueing network for outfitting process in shipbuilding. Computers & Operations Research 72: 1–11. DOI:https://doi.org/ 10.1016/j.cor.2015.05.002
    Ghadimi P, Toosi FG, Heavey C (2018) A multi-agent systems approach for sustainable supplier selection and order allocation in a partnership supply chain. European Journal of Operational Research, 269(1): 386–301. DOI:https://doi.org/ 10.1016/j.ejor.2017.07.014
    Goel V, Grossmann IE (2004) A stochastic programming approach to planning of offshore gas field developments under uncertainty in reserves. Computers & Chemical Engineering 28(8): 1409–1429. DOI:https://doi.org/ 10.1016/j.compchemeng.2003.10.005
    Günter H, Snoo CD, Shepherd C, Moscoso P, Riedel J (2011) Collaborative planning in supply chains: The importance of creating high quality relationships. Springer Berlin Heidelberg. DOI: https://doi.org/10.1007/978-3-642-13382-4_5
    Higle JL, Sen S (1991) Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Mathematics of Operations Research 16(3): 650–669. DOI:https://doi.org/ 10.1287/moor.16.3.650
    Hooshmand F, Mirhassani SA, Akhvein A (2018) Adapting GA to solve a novel model for operating room scheduling problem with endogenous uncertainty. Operations Research for Health Care 19: 26–43. DOI:https://doi.org/ 10.1016/j.orhc.2018.02.002
    Huo L, Wang JY (2022) Research on solving postdisaster material distribution and scheduling with improved NSGA-II algorithm. Computational Intelligence and Neuroscience 2022: 2529805. DOI:https://doi.org/ 10.1155/2022/2529805
    Jia HZ, Fuh JYH, Nee AYC, Zhang YF (2007) Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems. Computers & Industrial Engineering 53(2): 313–320. DOI:https://doi.org/ 10.1016/j.cie.2007.06.024
    Karanassos HA (2016) Ship's Outfit: Group 4. Commercial Ship Surveying. DOI: 10.1016/B978-0-08-100303-9.00009-2
    Keller B, Bayraksan G (2009) Scheduling jobs sharing multiple resources under uncertainty: A stochastic programming approach. Lie Transactions 42(1): 16–30. DOI: 10.1080/07408170902942683
    Lee JH, Kim SH, Lee K (2012) Integration of evolutional BOMs for design of ship outfitting equipment. Computer-Aided Design 2012(3): 44. DOI:https://doi.org/ 10.1016/j.cad.2011.07.009
    Leo E, Engell S (2022) Condition-based maintenance optimization via stochastic programming with endogenous uncertainty. Computers and Chemical Engineering 156: 107550. DOI:https://doi.org/ 10.1016/j.compchemeng.2021.107550
    Li C, Grossmann IE (2021) A review of stochastic programming methods for optimization of process systems under uncertainty. Frontiers in Chemical Engineering 2: 622241. DOI: 10.3389/fceng.2020.622241
    Li XT, Dai YX, Ge YX, Liu J, Shan Y, Duan LY (2022) Uncertainty modeling for out-of-distribution generalization. Computer Science arXiv: 2202.03958. https://doi.org/10.48550/arXiv.2202.03958
    Lucht T, Mutze A, Kmpfer T, Nyhuis P (2021) Model-based approach for assessing planning quality in production logistics. IEEE Access 2021(9): 1–13. DOI:https://doi.org/ 10.1109/ACCESS.2021.3104717
    Menon KG, Fukasawa R, Ricardez-Sandoval LA (2021) A novel stochastic programming approach for scheduling of batch processes with decision dependent time of uncertainty realization. Annals of Operations Research 305(1): 163–190. DOI: 10.1007/s10479-021-04141-w
    Mohammed A, Harris I, Govindan K (2019) A hybrid MCDM-FMOO approach for sustainable supplier selection and order allocation. International Journal of Production Economics 217: 171–184. DOI:https://doi.org/ 10.1016/j.ijpe.2019.02.003
    Najafi AA, Zoraghi N, Azimi F (2011) Scheduling a project to minimize costs of material requirements. International Journal of Industrial and Manufacturing Engineering 5(6): 968–971. DOI: 10.13140/2.1.2098.3681
    Pereira MVF, Pinto LMVG (1991) Multi-stage stochastic optimization applied to energy planning. Mathematical Programming 52: 359–375. DOI: 10.1007/BF01582895
    Rahman HF, Nielsen I (2019) Scheduling automated transport vehicles for material distribution systems. Applied Soft Computing 82: 105552. DOI: 10.1016/j.asoc.2019.105552
    Rose CD, Coenen JMG (2015) Comparing four metaheuristics for solving a constraint satisfaction problem for ship outfitting scheduling. International Journal of Production Research 53(19–20): 5782–5796. DOI:https://doi.org/ 10.1080/00207543.2014.998786
    Sha Y, Zhang J, Cao H (2021) Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties. European Journal of Operational Research 290(3): 886–900. DOI: 10.1016/j.ejor.2020.08.0570
    Sajadieh MS, Shadrokh S, Hassanzadeh F (2009) Concurrent project scheduling and material planning: A genetic algorithm approach. Scientia Iranica 16(2): 91–99. DOI:https://doi.org/ 10.1016/j.ssci.2008.10.016
    Smith-Daniels DE, Smith-Daniels VL (1987) Optimal project scheduling with materials ordering. IIE Transactions 19(2): 122–129. DOI:https://doi.org/ 10.1080/07408178708975378
    Smith-Daniels DE, Aquilano NJ (1984) Constrained resource project scheduling subject to material constraints. Journal of Operations Management 4(4): 369–387. DOI: 10.1016/0272-6963(84)90022-6
    Tabrizi BH, Ghaderi SF (2016) A robust bi-objective model for concurrent planning of project scheduling and material procurement. Computers & Industrial Engineering 98: 11–29. DOI:https://doi.org/ 10.1016/j.cie.2016.05.017
    Tabrizi BHJ (2018) Integrated planning of project scheduling and material procurement considering the environmental impacts. Computers & Industrial Engineering 120: 103–115. DOI: 1016/j.cie.2018.04.031 https://doi.org/ 10.1016/j.cie.2018.04.031
    Tang L, Li F, Chen ZL (2019) Integrated scheduling of production and two-stage delivery of make-to-order products: Offline and online algorithms. Informs Journal on Computing 31(3): 493–514. DOI:https://doi.org/ 10.1287/ijoc.2018.0842
    Wang G, Hu X, Li X, Zhang Y, Feng S, Yang A (2020) Multiobjective decisions for provider selection and order allocation considering the position of the CODP in a logistics service supply chain. Computers & Industrial Engineering 140: 106216.1–106216.15. DOI:https://doi.org/ 10.1016/j.cie.2019.106216.
    Wang J, Zhu M, Fan X, Yin X, Zhou Z (2020) Multi-channel augmented reality interactive framework design for ship outfitting guidance. IFAC-Papers On Line 53(5): 189–196. DOI: 10.1016/j.ifacol.2021.04.098
    Wassick JM, Agarwa A, Akiya N, Ferrio J, Bury S, You F (2012) Addressing the operational challenges in the development, manufacture, and supply of advanced materials and performance products. Computers & Chemical Engineering 47: 157–169. DOI: 10.1016/j.compchemeng.2012.06.041
    Yazdaninejad M, Amjady N, Hatziargyriou ND (2021) Nested Bilevel Optimization for DERA Operation Strategy: A Stochastic Multiobjective IGDT Model With Hybrid Endogenous/Exogenous Scenarios. IEEE Systems Journal 15(4): 5495–5506. DOI:https://doi.org/ 10.1109/JSYST.2021.3085987
    Zeng C, Tang J, Fan Z (2019) Auction-based approach for a flexible job-shop scheduling problem with multiple process plans. Engineering Optimization 51(11): 1902–1919. DOI: 10.1080/0305215X.2018.1561884
    Zhang Y, Cui N (2021) Project scheduling and material ordering problem with storage space constraints. Automation in Construction 129(5): 103796. DOI: 10.1016/j.autcon.2021.103796
    Zhou BH, Shen CY (2018) Multi-objective optimization of material delivery for mixed model assembly lines with energy consideration. Journal of Cleaner Production 192: 293–305. DOI: 10.1016/j.jclepro.2018.04.251
WeChat click to enlarge
Figures(5)  /  Tables(15)
Publishing history
  • Received:  12 September 2022
  • Accepted:  17 January 2024

目录

/

Return
Return