The coordination of production scheduling and traortation has recently received a lot of attention in logistics and manufacturing management research. This thesis addresses the production and delivery scheduling integration problem; a manufacturer receives n orders from one customer while the orders need to be processed on one machine and be sent to the customer in batches. The objective is to minimize the sum of the total weighted of tardiness and the delivery costs. The problem is strongly NP-hard.two math programming models including Mixed Integer Non Linear Programming (MINLP) and Mixed Integer Programming (MIP) models and a Heuristic Algorithm (HA) are presented for solving it. Computational test is performed for evaluation of these three methods. The obtained results show that the heuristic algorithm is efficient. For determine efficiency, Analysis of variance (ANOVA) technique was used. The results showed that the HA is the most efficient method.also In this thesis, two new methods including ltr"
