Liang-Liang Fu

TL;DR: This paper considers coordinated production and interstage batch delivery scheduling problems, where a third-party logistics provider (3PP) delivers semi-finished products in batches from one production location to another production location belonging to the same manufacturer.

TL;DR: One of these algorithms allows us to compute a lower bound for the NP-hard problem NSP–NSD, which is used in a branch-and-bound (B&B) algorithm to solve problem N SP-NSD.

TL;DR: This note suggests faster algorithms for two integrated production/distribution problems studied earlier, improving their complexities from O(n2V + 4) and O (n2(L + V)2) to O( n) andO(n + Vmin {V, n}) respectively.

TL;DR: In this article, an integrated production and outbound distribution scheduling problem with one manufacturer and one customer is studied, where each job has a release date and a delivery deadline, and the objective is to decide a feasible integrated production/distribution schedule minimizing the transportation cost subject to the delivery deadline constraints.

TL;DR: In this paper, the authors consider scheduling problem in a supply chain with two actors, a manufacturer and a third-party logistics (3PL), and they provide exact polynomial-time algorithms or prove the NP-completeness of the scheduling problems in these three types of contract.