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.
This paper proposes a hybrid ACO approach to minimize weighted tardiness for a batch-processing machine in diffusion area with incompatible jobs and dynamic arrival time. The method combines ACO algorithm and NACH (Next Arrival Control Heuristic) method, and also puts the batching and scheduling process together. The proposed method is validated and verified by extensive simulation experiments. The...
This paper addressed the problem of blocks relocation in the export container yard. Previous studies of this problem have been limited in consideration of the relocation number only. However, crane operation consists of both trolley and spreader moves within the same bay. The number of relocation is not enough to be the best overall measurement for reducing the unproductive time. In the spirit of...
We consider a problem of order-lot pegging in a semiconductor wafer fabrication facility. In the problem, we determine assignments of wafers in lots to orders and plans for input release of wafers into wafer fabrication facility with the objective of minimizing the total tardiness of orders over finite time horizon. The problem is formulated as a mixed integer linear program. To tackle industrial-sized...
This study employed simulated annealing (SA) to optimize minimum-cost design of sewer network. A sewer network design which contains significantly varied elevations was used as a case study. The results show that SA is able to achieve least-cost solutions which also fulfill all the constraints of design criteria. Based on the average performance of 200 trials, SA exhibits robustness and efficiency...
In this paper, a heuristic algorithm which embedded in the Lagrangian relaxation algorithm is proposed to obtain the near optimal solution to minimize the total weighted complete time in the Hybrid flow shop problem (HFS). Compared with the original precedence capacity relaxation algorithm proposed by Tang et al., our algorithm can produce a better solution in most cases.
This paper presents a two-machine flowshop scheduling problem with family sequence-dependent setup times and a common due window. The objective is to minimize the sum of earliness and tardiness according to the common due window. The problem is found to be NP-hard. And a niche genetic algorithm (NGA) with sharing as the population diversity mechanism is developed for it, in which the distance of two...
We discuss a scheduling problem for a two-machine robotic flow-shop with a bounded intermediate station and robots which is realistic in FMCs (flexible manufacturing cells). The problem asks to minimize the total weighted completion time. It is NP-hard. In this paper, we propose a heuristic algorithm based on GA (Genetic Algorithm) which is applicable to the problem, and which allows not only permutation,...
An alternative way for increasing the efficiency of transportation management system is to usef dynamic multi-zone dispatching. This problem concentrates on the quantities of inbound and outbound in each area and it is modified from the multi-zone dispatching. The factors of the rearrangement penalty of the area, in each zone, including time periods are also included. The objective of this research...
A lot of researches have been achieved on Hazmat transportation routing problem in order to take into both transportation out-of-pocket expenses and risk-related costs which are viewed as static. In this work, we consider the following hazmat transportation problem: a given set of hazmat shipments has to be shipped over a road transportation network in order to transport a given amount of hazardous...
This paper presents a simulated genetic algorithm model of scheduling the flow shop problems with re-entrant jobs. The objectives of this research are to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines with the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are required...
The mixed logit (ML) discrete choice model is highly flexible and capable of modeling complex choice behaviors. A popular method for estimation of an ML model is through maximization of a simulated likelihood function, which, however, often contains multiple local optima in a high-dimensional solution space. This paper reports the development of a dynamic differential evolution (DE) algorithm for...
Parallel machine with eligibility scheduling problem is commonly seen in manufacturing industries such as semi-conductor manufacturing. This paper takes flexibility concept into consideration and develops a novel heuristic algorithm to minimize makespan of the problem. Mathematical model is developed as an effectiveness comparison to this algorithm. Data test uses random generated problem with given...
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.