نتایج جستجو برای: due date assignment scheduling

تعداد نتایج: 1180236  

Journal: :International Journal on Recent and Innovation Trends in Computing and Communication 2023

One of the most significant optimization issues facing a manufacturing company is flexible flow shop scheduling problem (FFSS). However, FFSS with uncertainty and energy-related elements has received little investigation. Additionally, in order to reduce overall waiting times earliness/tardiness issues, topic shared due dates researched. Using transmission line loadings bus voltage magnitude va...

2003
Teerawat Issariyakul Ekram Hossain

In this paper, the problem of fair scheduling in a wireless network is formulated as an assignment problem and an Optimal Radio Channel Allocation (ORCA) strategy is proposed for fair bandwidth allocation in a centralized manner. Simulation results show that the performance improvement due to ORCA can be significant compared to other wireless fairqueuing mechanisms proposed in the literature su...

Journal: :Journal of Industrial and Management Optimization 2023

This article addresses resource allocation scheduling problems with slack due window on a single machine. Linear and convex are considered. Our goal is to determine the optimal schedule, window, allocation, minimizing various objective functions respect criteria (position-dependent weights number of early jobs, tardy starting time, size) consumption function. For linear problem, we study two ca...

2011
Christos Koulamas

We analyze a number of due date assignment problems with the weighted number of tardy jobs objective and show that these problems can be solved in O(n) time by dynamic programming. We show that the effects of learning or the effects of past-sequence-dependent setup times can be incorporated into the problem formulation at no additional computational cost. We also show that some single-machine d...

Journal: :Journal of Industrial and Management Optimization 2023

This paper investigates the single-machine due-window assignment scheduling with truncated learning effects and past-sequence-dependent setup times simultaneously. The scheduler has option of job-rejection, i.e., some jobs are processed other rejected. Under three (i.e., common, slack different) methods, our goal is to minimize sum a general earliness-tardiness cost weighted earliness-tardiness...

2009
Mathias Bohge Adam Wolisz

Dynamically assigning sub-carriers in the downlink of an OFDMA based cellular system has been shown to exhibit a high potential to combat co-channel interference in according systems. So far, related investigations have assumed up-to-date channel state information as input for the sub-carrier assignment mechanisms, omitting the fact that in most cases there is a significant delay between the ti...

2006
Hong-Ren Chen Y. H. Chin

A lot of research works have been done in this filed of real-time database systems to seek for optimizing transaction scheduling. The findings of such studies examining the use of various algorithms of priority assignment policy have been discussed widely. One drawback of these approaches is presenting poor performance due to neglect repetitively missed real-time transactions. In this paper, an...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید