Deferred payment and revenue-sharing contracts are significantly important for promoting the collaboration and the management of retail export supply chains for cross-border e-commerce. This research addresses the real-world challenges faced by managers in this domain by using a joint optimization model to investigate the best ordering and pricing tactics within cross-border e-commerce retail export supply chains, particularly taking into account export tax rebates and import tariffs. Our findings reveal that while revenue-sharing contracts and deferred payment mechanisms can significantly enhance supply chain profitability, their effectiveness is contingent on variables such as export rebate rates, tariffs, and tariff transfer factors. The practical implications of this study suggest that business administrators should carefully assess these factors when designing contracts to ensure robust supply chain coordination. When traditional contract mechanisms fail, hybrid approaches combining revenue-sharing and deferred payment can offer superior outcomes, thus providing a strategic advantage in volatile markets. These insights are crucial for managers seeking to navigate the complexities of international trade and optimize their supply chain performance.

This study focuses on the flexible job shop scheduling problem with sequence-dependent setup times (FJSP-SDST), and the goal is minimizing the makespan. To solve FJSP-SDST, first, we develop a constraint programming (CP) model to obtain optimal solutions. Due to the NP-hardness of FJSP-SDST, a CP assisted meta-heuristic algorithm (C-VNS-CP) is designed to make use of the advantages of both CP model and cooperative variable neighborhood search (C-VNS). The C-VNS-CP algorithm consists of two stages. The first stage involves C-VNS, for which eight neighborhood structures are defined. In the second stage, CP is used to further optimize the good solution obtained from C-VNS. In order to prove the efficiency of the C-VNS algorithm, CP model, and C-VNS-CP algorithm, experiments of 20 instances are conducted.

Many uncertainties arise during the manufacturing process, such as changes in the working environment, traffic transportation delays, machine breakdowns, and worker performance instabilities. These factors can cause job processing times and ready times to change. In this study, we address a scheduling model for a single machine where both job release dates and processing times are scenario dependent. The objective is to minimize the total completion time across the worst-case scenarios. Even without the uncertainty factor, this problem is NP-hard. To solve it, we derive several properties and a lower bound used in a branch-and-bound method to find an optimal solution. We propose nine heuristics based on a linear combination of scenario-dependent processing times and release times for approximate solutions. Additionally, we offer an iterated greedy population-based algorithm that efficiently solves this problem by taking advantage of the diversity of solutions. We evaluate the performance of the proposed nine heuristics and the iterated greedy population-based algorithm.

Facing current client expectations for high quality, timely order response, and multiple shipments of various needed merchandise, today’s producers must simultaneously satisfy external requirements and operate internally with minimum overall expenses and capacity constrained. Aiming to help present-day producers achieve the operational goals mentioned above, this work develops a decisional scheme to determine the best manufacturing-delivery policy for a multi-item economic production quantity (EPQ) system with multi-shipment, quality assurance, overtime, postponement, and external source. Combining a production postponement strategy in our multi-item batch fabricating procedures intends to first make all required standard/common parts for various client-needed merchandise and make finished goods in the 2nd phase. Two fabricating-uptime-shortening strategies are adopted: contracting out a proportion of the standard part’s batch and overtime-making of finished goods. We include screening and rework tasks in fabricating procedures to help us remove the identified scraps and correct the repairable faulty items. The quality-assured finished batches are divided into multiple equal-amount shipments transported to meet client requests. The overall manufacturing-transportation relevant expenses, including quality and uptime-expedited costs, are mathematically modeled and minimized using optimization methodology to help derive the best manufacturing-delivery operating policy. Moreover, we offer an illustration to validate the results and our research scheme’s capability numerically. This work mainly contributes to the literature by presenting a practical decision-making model. It enables the producers to expose numerous crucial problem-related managerial insights to facilitate producers in deciding the most appropriate manufacturing-delivery policy to meet clients’ multi-criteria demands.

Assembly lines, generally speaking, can reduce production costs, shorten cycle times, and achieve higher quality levels. Since the current market is characterized by increasing product variability, mixed-model assembly lines, in which similar product models can be assembled simultaneously, are more suitable to respond to varied market demands than traditional single-model assembly lines. In addition, in an assembly line, tasks often differ in processing requirements, and workers may have different qualification levels. This study, therefore, aims to construct models for the multi-objective mixed-model assembly line balancing problem with hierarchical worker assignment (MO-MALBP-HW). The goal is to generate a suitable plan for a mixed-model assembly line balancing problem considering the constraint of a hierarchical workforce, the cost of a hierarchical workforce, and production cycle time. When the problem is simple, it can be solved by a mixed integer programming (MIP) model. When the problem becomes complex, it can be solved by a multi-objective genetic algorithm (MOGA) and a non-dominated sorting genetic algorithm II (NSGA-II) to obtain a near-optimal solution. The implementation of this model can effectively manage the multi-objective mixed-model assembly line balancing plan, thereby improving plant efficiency and reducing cost.

This paper presents a literature review for inventory control of deteriorating items since 2018. A classification including 18 classes and 33 subclasses is offered to categorize inventory control models, constraints, and solution methods used in previous studies. Providing standard classes in this field, such as demand, deterioration, shortages, number of warehouses, and time value of money alongside new classes, for example, the type of model costs and supply chain, inventory constraints, number of supply chain levels, time horizon, lead time, considering multi-item models, preservation technology, financial conditions, non-instantaneous deteriorating items, environmental issues, and solution methods made this classification more comprehensive. A brief history and explanation are given to understand each class better, and related articles are grouped in these classes. The research gaps and a crucial aspect that paves the way for future research are presented in each category. A broad view of the future of this topic is provided, and exciting opportunities are highlighted for researchers to contribute to this field and inspire them to explore these potential areas of research. The potential for future research in this subject is vast and promising; this article offers numerous opportunities for researchers to make significant contributions. The results show that the best ways to extend this topic are using variable deterioration rates, costs, and demand functions, considering realistic assumptions, including allowable shortages with partial backlogging, two warehouses, inflation and discounts, preservation technology, uncertain lead time, and environmental issues. Developing cyclic (if possible), multi-item, and production models with financial conditions and various inventory constraints is an excellent way to develop existing models. Finally, solving the proposed models using exact methods to find the global answer is a great effort to contribute to this field.

Crowd-shipping, employing private drivers to partially replace company-owned trucks in distribution, has emerged as a prominent trend for its cost-effectiveness and sustainability. While crowd-shipping is known as a distribution pattern that combines economic efficiency and environmental benefits, however, the frequent occurrence of traffic congestion has made this pattern less effective than it should be. In this research, the problem of vehicle routing optimization under traffic congestion is investigated from the perspective of simultaneously reducing environmental pollution and costs. Considering private drivers picking up and delivering parcels on the way, this study incorporates the objective of minimizing transport as well as particulate matter (PM) and nitrogen oxides (NOx) emission costs into route optimization for crowd-shipping and proposes a Green Pickup and Delivery Problem with Private Drivers (GPDP-PD). To be more realistic, vehicle speeds depend on the level of traffic congestion, reflecting the time-dependent nature of the proposed model. An improved adaptive large neighborhood search (ALNS) algorithm is developed, and computational experiments are conducted to demonstrate the efficiency of the improved ALNS. Case studies show that there is uncertainty about the environmental benefits of crowd-shipping under traffic congestion. Our proposed model is capable of efficiently allocating private drivers and optimizing vehicle routes according to road conditions, thus identifying the crowd-shipping operational scheme with the lowest cost and emissions. Moreover, a time limit of 0.7-0.8 h and the low cost of private drivers can achieve environmental and economic benefits simultaneously. It provides useful insights into the sustainability of logistics and distribution.

This study addresses the minimization of total tardiness in a hybrid flow shop scheduling problem with sequence-dependent setup times and blocking constraints. Each production stage includes multiple machines, and there are no buffers between the stages. The setup time required to process a job depends on the previously processed job. Two mixed-integer linear programming models are developed to formulate the problem. Moreover, an iterative local search algorithm and hybrid genetic algorithms are proposed to have quality solutions with minimal computational efforts. Several computational tests are conducted to tune the heuristic parameters for better performance. Computational experiments are carried out to evaluate the performance of solution methodologies in terms of quality and time. The results indicate that while mixed-integer programming models can solve small-size problem instances, they are not capable of solving large-sized instances. However, the proposed heuristic algorithms find quality solutions for all instances in a very short time.

The study examines the influence of different carbon policies and the incorporation of green technologies in a two-echelon supply chain, with a focus on carbon emissions generated during transportation, production, and storage phases. The study evaluates three strategies for controlling carbon emissions: setting a maximum limit on total emissions, implementing carbon-taxation, and adopting a cap-and-trade framework. The proposed model assists businesses determine the optimal production and delivery volumes, as well as calculate the most effective investment in green technologies to reduce costs in the context of different carbon emission regulations. Furthermore, this study offers practical guidance for policymakers, highlighting the importance of balancing environmental sustainability with economic growth. Results indicate that companies are more inclined to pursue advanced green technology solutions under a carbon tax policy. The analysis highlights that carbon emissions per unit of production and transportation distance significantly impact overall emissions. The imposed emission cap has a stronger influence than the emission reduction potential of green technologies. The study recommends that governments establish realistic emission limits in cap-and-trade schemes to prevent excessive trading of emission allowances by suppliers.

In automated high-bay warehouses, the results of storage location allocation significantly impact the operational efficiency of subsequent warehouse operations. Considering that cargo loss within the warehouse is often caused by contact with equipment, this paper proposes an innovative dual-objective optimization model aimed at minimizing unit cargo loss and the average travel time of stacker cranes through rational storage allocation. The study’s findings indicate that different cargo sizes, shelf sizes, and operational modes have varying degrees of impact on stacker crane operational efficiency and cargo loss. A reasonable match between equipment and product sizes helps enterprises minimize space waste, expedite response to customer demands, and reduce operational costs. This study optimizes storage location allocation using the SPEA-II algorithm and performs a comprehensive comparison with the results from CPLEX and NSGA-II. The results demonstrate that the SPEA-II algorithm performs excellently across various problem scales, indicating that it is an effective method for solving storage location allocation issues.