The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we consider a combinatorial optimization problem of scheduling n jobs of block type on linearly aligned m identical machines. Each job Jj is characterized by four integers, an arrival time aj , a processing time pj, the number qj of consecutive machines required by the job (hence, each job Jj can be represented by a rectangular block with the size of pj × qj in a geometrical interpretation),...
Well known job schedule problem is NP-hard in management and operating system. A few of evolution algorithms such as GA have been proposed to approach this kind of problems. At present estimation of distribution algorithms are the leading heuristic algorithms which overcome the defect of tradition GA and reflex more excellent property than others. In this paper effective of EDA are tested by the job...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.