توجه: محتویات این صفحه به صورت خودکار پردازش شده و مقاله‌های نویسندگانی با تشابه اسمی، همگی در بخش یکسان نمایش داده می‌شوند.
۱Minimizing maximum tardiness in a multi–machine earliest due date problem in flow shop & job shop environment using a proposed heuristic model.
نویسنده(ها): ،
اطلاعات انتشار: دومین کنفرانس بین المللی تحقیق در عملیات ایران، سال
تعداد صفحات: ۴
In this study a scheduling problem is considered. The objective is to minimize the maximum tardiness and in similar cases tardiness to minimize the total summation of tardiness penalties. In order to achieve such an objective a single machine scheduling problem algorithm is considered and its algorithm is extended to multi–machine scheduling. Two kinds of problems are considered as flow shop and job shop. In the flow shop problem jobs should be processed on m machines respectively. In the job shop jobs should be rocessed on some of the m machines in different orders. At the end of the study numerical example is exhibited.<\div>

۲MULTI–OBJECTIVE VEHICLE ROUTING PROBLEM WITH TIME WINDOW
نویسنده(ها): ،
اطلاعات انتشار: دومین کنفرانس بین المللی تحقیق در عملیات ایران، سال
تعداد صفحات: ۴
In this paper, a vehicle routing problem (VRP) is considered with different considerations, such as capacitated VRP, VRP with backhauling, and VRP with time window. We consider the capacitated VRP with time window and substitute the traditional objective function with a multi–objective function consisting of three objectives: namely, traveling distance cost, traveling time cost, and waiting time cost. Also the problem considers a pickup & delivery problem which each node consists of a pickup terminal and a delivery terminal. The solution methodology is based on genetic algorithms, in which the number of routes are constant and known.<\div>
نمایش نتایج ۱ تا ۲ از میان ۲ نتیجه