- Journal
- Année
- 2011
- Pages
- 344-349
Abstract
We consider a general two-stage scheduling problem in which n identical jobs with given due dates are batch processed by one first-stage processor and then, in the second stage, the completed jobs need to be batch delivered to a pre-specified customer by a capacitated transporter. Delay is not allowed. Moreover, it is supposed that a job which is finished before its delivery date or arrive at the customer before its due date will incur an earliness penalty which is equivalent to the corresponding inventory cost. The objective is to find a coordinated schedule of production and transportation such that the sum of setup, production, inventory and delivery cost is minimized. We firstly proposed a branch and bound (BBP) algorithm based on some properties for solving this problem. Then in order to improve the time efficiency, we proposed a heuristic-greedy algorithm (G). Computational results indicate the efficiency of the proposed algorithm.