Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,

Acquires this research importance of addressing the subject (environmental problems) with
age group task, a category that children pre-school, and also reflected the importance of
research, because the (environmental problems) constitute a major threat to the continuation
of human life, particularly the children, so the environment is Bmchkladtha within
kindergarten programs represent the basis of a hub of learning where the axis, where the
kindergarten took into account included in the programs in order to help the development of
environmental awareness among children and get them used to the sound practices and
behaviors since childhood .
The research also detected problem-solving skills creative with kids Riyad

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi