Optimal design of the auto parts supply chain for JIT operations: Sequential bifurcation factor screening and multi-response surface methodology

This research proposes a solution framework based on discrete-event simulation, sequential bifurcation (SB) and response surface methodology (RSM) to address a multi-response optimization problem inherent in an auto parts supply chain. The objective is to identify the most efficient operating setting that would maximize the logistics performance after the expansion of the assembly plant’s capacity due to market growth. In the proposed framework, we first construct a comprehensive simulation as a platform to model the physical flow of the auto parts operations. We then apply the SB to identify the most important factors that influence system performance. To determine the optimal levels of these key factors, we employ RSM to develop metamodels that best describe the relationship between key decision variables and the multiple system responses. We adapt the Derringer–Suich’s desirability function to find the optimal solution of the metamodels. Computational study shows that our method enables the greatest improvement on system performance. The proposed method helps the case firm develop insights into system dynamics and to optimize the operating condition. It realizes the performance objective of the auto parts supply chain without the need for additional fiscal investment.     

Minimizing the makespan in a two-machine cross-docking flow shop problem

This paper studies a two-machine cross-docking flow shop scheduling problem in which a job at the second machine can be processed only after the processing of some jobs at the first machine has been completed. The objective is to minimize the makespan. We first show that the problem is strongly NP-hard. Some polynomially solvable special cases are provided. We then develop a polynomial approximation algorithm with an error-bound analysis. A branch-and-bound algorithm is also constructed. Computational results show that the branch-and-bound algorithm can optimally solve problems with up to 60 jobs within a reasonable amount of time.     

Synchronization in cross-docking networks: A research classification and framework

Cross-docking is a distribution strategy that enables the consolidation of less-than-truckload shipments into full truckloads without long-term storage. Due to the absence of a storage buffer inside a cross-dock, local and network-wide cross-docking operations need to be carefully synchronized. This paper proposes a framework specifying the interdependencies between different cross-docking problem aspects with the aim to support future research in developing decision models with practical and scientific relevance. The paper also presents a new general classification scheme for cross-docking research based on the inputs and outputs for each problem aspect. After classifying the existing cross-docking research, we conclude that the overwhelming majority of papers fail to consider the synchronization of local and network-wide cross-docking operations. Lastly, to highlight the importance of synchronization in cross-docking networks, two real-life illustrative problems are described that are not yet addressed in the literature.     

Effects of protein conformation in docking: improved pose prediction through protein pocket adaptation

Computational methods for docking ligands have been shown to be remarkably dependent on precise protein conformation, where acceptable results in pose prediction have been generally possible only in the artificial case of re-docking a ligand into a protein binding site whose conformation was determined in the presence of the same ligand (the “cognate” docking problem). In such cases, on well curated protein/ligand complexes, accurate dockings can be returned as top-scoring over 75% of the time using tools such as Surflex-Dock. A critical application of docking in modeling for lead optimization requires accurate pose prediction for novel ligands, ranging from simple synthetic analogs to very different molecular scaffolds. Typical results for widely used programs in the “cross-docking case” (making use of a single fixed protein conformation) have rates closer to 20% success. By making use of protein conformations from multiple complexes, Surflex-Dock yields an average success rate of 61% across eight pharmaceutically relevant targets. Following docking, protein pocket adaptation and rescoring identifies single pose families that are correct an average of 67% of the time. Consideration of the best of two pose families (from alternate scoring regimes) yields a 75% mean success rate.