نتایج جستجو برای: single machine
تعداد نتایج: 1110707 فیلتر نتایج به سال:
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
هدف ما در این پایان نامه طراحی و ساخت سیستم مولد پلاسمای فلزات قلیایی به نام q-machine vertical می باشد.این سیستم از چند قسمت تقسیم شده است که عبارتند از: 1- محفظه خلا با اتصالات از نوع استاندارد cf و خلا اولیه بین6-10 تاtorr 8-10که بصورت استوانه ای و سه تکه و از جنس استنلس استیل 316 می باشد. 2- آهنرباهای الکتریکی: که وظیفه دارند میدان مغناطیسی محوری یکنواخت وثابتی در حدود 5/0 تسلا در طول قس...
We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular functions (associated with each job),...
In this paper we deal with the dual criteria optimization, explore the complexity status of hierarchical scheduling on a single machine. Hierarchical optimization is a special case of dual criteria optimization, where the most important criterion is at its optimal value. We'll assume the complexity of hierarchical scheduling on a single machine. While doing this, we'll use the case of two crite...
We introduce a natural but seemingly yet unstudied generalization of the problem scheduling jobs on single machine so as to minimize number tardy jobs. Our lies in simultaneously considering several instances at once. In particular, we have n clients over period m days, where each client has job with its own processing time and deadline per day. goal is provide schedule for that guaranteed thei...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید