In this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completion time and maximum tardiness. The second is minimizing total completion time and maximum earliness. We used these efficient solutions to find a near-optimal solution for another problem which is a sum of maximum earliness and maximum tardiness. This means we eliminate the total completion time from the two problems. The algorithm was tested on a set of problems of different n. Computational results demonstrate the efficiency of the proposed method.
The Caputo definition of fractional derivatives introduces solution to the difficulties appears in the numerical treatment of differential equations due its consistency in differentiating constant functions. In the same time the memory and hereditary behaviors of the time fractional order derivatives (TFODE) still common in all definitions of fractional derivatives. The use of properties of companion matrices appears in reformulating multilevel schemes as generalized two level schemes is employed with the Gerschgorin disc theorems to prove stability condition. Caputo fractional derivatives with finite difference representations is considered. Moreover the effect of using the inverse operator which tr
This paper develops a fuzzy multi-objective model for solving aggregate production planning problems that contain multiple products and multiple periods in uncertain environments. We seek to minimize total production cost and total labor cost. We adopted a new method that utilizes a Zimmermans approach to determine the tolerance and aspiration levels. The actual performance of an industrial company was used to prove the feasibility of the proposed model. The proposed model shows that the method is useful, generalizable, and can be applied to APP problems with other parameters.
The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a
... Show Morehe assignment model represents a mathematical model that aims at expressing an important problem facing enterprises and companies in the public and private sectors, which are characterized by ensuring their activities, in order to take the appropriate decision to get the best allocation of tasks for machines or jobs or workers on the machines that he owns in order to increase profits or reduce costs and time As this model is called multi-objective assignment because it takes into account the factors of time and cost together and hence we have two goals for the assignment problem, so it is not possible to solve by the usual methods and has been resorted to the use of multiple programming The objectives were to solve the problem of
... Show MoreBackground: Gliomas are brain tumours of supporting tissue of the brain. The management of low grade glioma is still a great debate ranges from just follow up to extensive surgery followed by DXT, with or without chemothery.
Patients and Methods: 282 patients taken from neuro-surgical hospital between 1980-1990, divided to 3 groups with different modality of management & follow up for 15 years.
Results: the five years survival and symptomatic improvement was higher in the group managed by extensive surgery and DXT with or without cytoxic drugs followed by group managed by biopsy and DXT with or without cytoxic.
Conclusion: management of low grade glioma symptoms & out come (survival) is best by extensive surgery & DX