نتایج جستجو برای: dependent setup times
تعداد نتایج: 1038006 فیلتر نتایج به سال:
Parallel Machine Scheduling Problem with Unavailable Time Periods and Sequence Dependent Setup Times
Makine çizelgeleme problemlerinde tüm makineler daima kullanılabilir durumda değildirler. Planlı bakım, öğle yemeği ve dinlenme molaları gibi nedenlerle periyodik olarak kesintilere uğrayabilmektedirler. Ancak literatürde genellikle bu durum göz ardı edilmektedir. Bu çalışmada kullanılamayan zaman dilimlerinin sıra bağımlı hazırlık sürelerinin olduğu ilişkisiz paralel makine problemi ele alınmı...
This paper considers the hybrid flow shop scheduling problem with two types of sequence-dependent setup times, one depending on order jobs and other both machines where are allocated. Three constructive heuristic algorithms based NEH algorithm developed object minimizing total energy consumption cost. The first algorithm, called EPRA, obtains using cost processing time. second ESRA, third ESPRA...
This paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. For solving this multi-objective model, we develop a fuzzy multi-objective linear programming (FMOLP) model. In this problem, a proposed FMOLP method is applied with respect to the o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید