Abstract (EN)

In this paper, we consider scheduling problem in a supply chain with two actors, a manufacturer and a third-party logistics (3PL). The manufacturer has to process a set of jobs at the upstream stage and the downstream stage. The 3PL is in charge of transportation of semi-?nished products from the upstream stage to the downstream stage. The manufacturer’s objective is to minimize makespan Cmax and the 3PL’s objective is to minimize transportation cost TC. We investigate three different types of contract: the manufacturer dominates, the 3PL adjusts; the manufacturer dominates, the 3PL negotiates; the manufacturer and the 3PL have the same bargaining power and cooperate. We provide exact polynomial-time algorithms or prove the NP-completeness of the scheduling problems in these three types of contract. We evaluate the benefit of cooperation using numerical experiments.