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, unrelated parallel machine scheduling problem with job rejection and earliness-tardiness penalties is investigated. The objective is to minimize the total penalty cost by deciding job acceptance, assigning jobs on unrelated machines, and determining the processing sequence of jobs on each machine. To solve this problem, a mixed integer programming (MIP) model is established, and a hybrid...
Flexible job-shop scheduling problem (FJSP) is an extended job-shop scheduling problem. FJSP allows an operation to be processed by several different machines. FJSP with overlapping in operations means that each operation is divided into several sublots. Sublots are processed and transferred separately without waiting for the entire operation to be processed. In previous research, a mathematical model...
Constructing a timetable is a widespread problem. Computers can be employed to solve this problem faster and to produce better solutions. Software solutions for this problem already exist and are used by some universities. However, some universities have complex types of constraints that make it hard to use most of the available software solutions. This paper introduces a software solution for the...
Task scheduling is an important problem of radar resource management. Because of the limited resources constraints, an effective scheduling algorithm is necessary to allocate the resources of radar system. Traditional genetic algorithm (GA) can improve the time utilization rate (TUR) and scheduling success rate (SSR), but the time shifting rate (TSR) will increase at the same time, which goes against...
Satellite observation scheduling is a complex combinational optimization problem. Current researches usually adopt intelligent optimization methods to solve it, ignoring the similar historical scheduling cases. In order to improve algorithm performance, case-based learning method is introduced to the scheduling process. Considering the characteristic of the problem, a method of retrieving, matching...
The objective of this research is about building a class scheduling application using genetic algorithm. The parameters used in genetic algorithms namely: iteration, PM (Probability Mutation), PC (Probability crossover). In Faculty of Science and Technology UIN Jakarta, class schedule built by a staff. The staff faces numbers of obstacles when building the schedule, among others: the limitations of...
In the current scenario, Cloud computing carved itself as an emerging technology which enables the organization to utilize hardware, software and applications without any upfront cost over the internet. The challenge before the cloud service provider is, how efficiently and effectively the underlying computing resources like virtual machines, network, storage units, and bandwidth etc. should be managed...
Scheduling is a vital issue in cloud computing in order to facilitate optimized usage of resources. Genetic algorithms are used in optimization techniques as they are class of heuristic approaches that have their inspirations from evolutionary ideas of natural evolution. The cloud scheduling optimization problem is modelled as a population of candidate solutions and the genetic algorithm is applied...
Optimization of public transport operation is an integral component of an intelligent transport system. This paper shows that Genetic Algorithm can be used in developing the optimum schedule for buses plying EDSA. In this paper, the fitness function measure covered maximizing the ratio of the total additional revenue, over the total additional costs, both on the bus operators' and passengers' sides...
This paper addresses p-processes single processor scheduling problem with a common deadline, to minimize the total execution time and reduce the penalty costs. Process scheduling is one of the most essential factor on which the efficiency and the performance of the work done by the CPU depends. Earliness and tardiness of the processes degrades the efficiency of the processor as they carry penalty...
In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. Processing rate of an activity is the same function of the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with each activity...
Resource constrained project scheduling problem (RCPSP) is considered to be an NP hard problem. Over the last few decades, many different approaches have been developed in order to solve RCPSPs optimally within a reasonable time limit. However, no existing approach is well-accepted in this regard. In this paper, for efficiently solving RCPSPs, a memetic algorithm is proposed. The proposed algorithm...
Grid computing is a collection of geographically heterogeneous distributed computational resources that enables users for sharing data and other computing resources. One of the major challenges in grid computing is how to schedule batch jobs across such an environment with minimum makespan (the finishing time of the last job) and flow time. In this study, a hybrid batch job scheduling method is proposed...
In this paper, we discuss the scheduling problem of assigning jobs on multiple parallel machines with mold constraints. The mold constraint specifies that each job needs to be processed with specific molds on a machine and there is an arbitrary amount for each type of molds. Besides, different machines can mount different molds. Setup time is also considered when a first job in a machine starts or...
Cloud computing is the upcoming technology in current day scenario. It has emerged as a solution for providing resources to the consumers in the form of software, infrastructure or platform as a service. Cloud Service Storage enables users to synchronize their files across devices and also allows them to backup online. The main aim of this paper is to provide service optimization. Scheduling of services...
This paper proposes a genetic algorithm to solve resource constrained project scheduling problem, in which resources are optimally allocated to tasks. Resources are renewable. In RCPSP each activity is executing in single mode. This work employed genetic algorithm to schedule project task to minimize makespan respect to resource constraint and precedence constraint. The Schedule Generation Scheme...
In order to solve scheduling scheme of multiple supply points to provide a variety of emergency supplies for multiple hit points under large-scale disasters efficiently, after summarizing the existing research, mathematical model is constructed with the objective to minimize emergency response start time and the number of supply points, and a genetic algorithm to obtain optimal solution is designed...
With the emergence of call center and its wide applications in enterprises, the schedule of agents becomes a core problem for reasonably deploying the human resources in call center and improving the productive force of the call center. This study uses improved adaptive genetic algorithm (IAGA) to solve scheduling problem for a 24-hours call center. This paper builds a mathematical model to describe...
Different intelligent techniques have been proposed to solve the downlink resource allocation in orthogonal frequency division multiple access (OFDMA)-based networks. These include mathematical optimization, game theory and heuristic algorithms. In an attempt to improve the performance of traditional genetic algorithm (GA), we propose a novel improved GA (IGA) which uses a new mutation operator as...
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.