Three types of random fuzzy programming models are provided for single machine scheduling with random fuzzy processing times. A hybrid intelligent algorithm is designed to solve the proposed models and its effectiveness is illustrated by numerical experiments.Jin Peng...
and operating, using an OS action called process scheduling. Process scheduling allows an OS to specify a time window for the CPU execution of each process. Another significant advantage is that a process scheduling system keeps the CPU active at all times. By doing this, you can encourage pro...
The steps of the algorithm consist of constructing a job schedule network, transforming it into a single-commodity flow problem and finding the maximal flow through it. 展开 关键词: PRODUCTION scheduling ALGORITHMS POLYNOMIALS PROGRAMMING (Mathematics) WORKFLOW OPERATIONS research ...
We handle all of the individual requirements for each algorithm to ensure that each model is created following best practices “under the hood,” guaranteeing a model that gives the best results possible. Get started today by scheduling a demo. Share on dotData dotData Automated Feature Engineer...
Three fuzzy scheduling problems are discussed, the first two problems are solved by using the generalized Lawler's algorithm and the third is proved to be NP-hard even in some restrictive cases. In the third chapter, we consider several scheduling problems in which n independent and ...
An attempt to classify the types of clouds by a dual frequency microwave radiometer This work presents a new approach for the classification of cloud types (CT) from a dual frequency microwave radiometer time series. The algorithm is based... L Resteghini,C Capsoni,L Luini,... - IEEE 被...
For two job types, an efficient algorithm is presented considering only tight schedules; if more job types have to be considered the problem becomes NP-hard.Previous article in issue Next article in issue Keywords Lot-size scheduling Changeover cost Parallel machines Polynomial algorithm...
In order to solve this scheduling problem, we divide it into two phases based on job arrival times, and we also derive and prove certain constructive properties for these two phases. Relying on these properties, we develop a two-phase hybrid algorithm (TPHA). In addition, a valid lower ...
These attacks are independent of the number of rounds of the cryptosystems and of the details of the F -function and may have very small complexities. These attacks show that the key-scheduling algorithm should be carefully designed and that its structure should not be too simple. These attacks...
We show that the worst competitive ratio is obtained for an inclusive job-machine structure in which the first job type can be processed on any of the m machines while the second job type can be processed only on a subset of m/2 machines. Moreover, we show that our online algorithm is...