Two-Machine Flow-Shop Scheduling with Job Delivery Coordination

Abstract

This study considers a class of two-machine flow-shop scheduling problems with job delivery coordination. Both vehicle capacity and transportation times are also investigated. The objective is to minimize the mean arrival time of jobs. Two integer programming models are developed to optimally solve this problem. These two integer programming models are Models 1 and 2. Model 1 adopts the concept of assignment problem to formulate the proposed problems, while Model 2 bases on the dichotomous constraints models. Model 2 is theoretically better than Model 1 in size complexity analysis.