No-wait job-shop scheduling (NWJSS) problem is one of the classical scheduling problems that exist on many kinds of industry with no-wait constraint, such as metal working, plastic, chemical, and food industries. Seve...No-wait job-shop scheduling (NWJSS) problem is one of the classical scheduling problems that exist on many kinds of industry with no-wait constraint, such as metal working, plastic, chemical, and food industries. Several methods have been proposed to solve this problem, both exact (i.e. integer programming) and metaheuristic methods. Cross entropy (CE), as a new metaheuristic, can be an alternative method to solve NWJSS problem. This method has been used in combinatorial optimization, as well as multi-external optimization and rare-event simulation. On these problems, CE implementation results an optimal value with less computational time in average. However, using original CE to solve large scale NWJSS requires high computational time. Considering this shortcoming, this paper proposed a hybrid of cross entropy with genetic algorithm (GA), called CEGA, on m-machines NWJSS. The results are compared with other metaheuritics: Genetic Algorithm-Simulated Annealing (GASA) and hybrid tabu search. The results showed that CEGA providing better or at least equal makespans in comparison with the other two methods.展开更多
This paper studies a two stage supply chain with a dominant upstream partner. Manufacturer is the dominant partner and operates in a Just-in-Time environment. Production is done in a single manufacturing line capable ...This paper studies a two stage supply chain with a dominant upstream partner. Manufacturer is the dominant partner and operates in a Just-in-Time environment. Production is done in a single manufacturing line capable of producing two products without stopping the production for switching from one product to the other. The manufacturer imposes constraints on the distributor by adhering to his favorable production schedule which minimizes his manufacturing cost. Distributor on the other hand caters to retailers' orders without incurring any shortages and is responsible for managing the inventory of finished goods. Adhering to manufacturer's schedule may lead to high inventory carrying costs for the distributor. Distributor's problem, which is to find an optimal distribution sequence which minimizes the distributor's inventory cost under the constraint imposed by the manufacturer is proved NP-Hard by Manoj et al. (2008). Therefore, solving large size problems require efficient heuristics. We develop algorithms for the distribution problem by exploiting its structural properties. We propose two heuristics and use their solutions in the initial population of a genetic algorithm to arrive at solutions with an average deviation of less than 3.5% from the optimal solution for practical size problems.展开更多
文摘No-wait job-shop scheduling (NWJSS) problem is one of the classical scheduling problems that exist on many kinds of industry with no-wait constraint, such as metal working, plastic, chemical, and food industries. Several methods have been proposed to solve this problem, both exact (i.e. integer programming) and metaheuristic methods. Cross entropy (CE), as a new metaheuristic, can be an alternative method to solve NWJSS problem. This method has been used in combinatorial optimization, as well as multi-external optimization and rare-event simulation. On these problems, CE implementation results an optimal value with less computational time in average. However, using original CE to solve large scale NWJSS requires high computational time. Considering this shortcoming, this paper proposed a hybrid of cross entropy with genetic algorithm (GA), called CEGA, on m-machines NWJSS. The results are compared with other metaheuritics: Genetic Algorithm-Simulated Annealing (GASA) and hybrid tabu search. The results showed that CEGA providing better or at least equal makespans in comparison with the other two methods.
文摘This paper studies a two stage supply chain with a dominant upstream partner. Manufacturer is the dominant partner and operates in a Just-in-Time environment. Production is done in a single manufacturing line capable of producing two products without stopping the production for switching from one product to the other. The manufacturer imposes constraints on the distributor by adhering to his favorable production schedule which minimizes his manufacturing cost. Distributor on the other hand caters to retailers' orders without incurring any shortages and is responsible for managing the inventory of finished goods. Adhering to manufacturer's schedule may lead to high inventory carrying costs for the distributor. Distributor's problem, which is to find an optimal distribution sequence which minimizes the distributor's inventory cost under the constraint imposed by the manufacturer is proved NP-Hard by Manoj et al. (2008). Therefore, solving large size problems require efficient heuristics. We develop algorithms for the distribution problem by exploiting its structural properties. We propose two heuristics and use their solutions in the initial population of a genetic algorithm to arrive at solutions with an average deviation of less than 3.5% from the optimal solution for practical size problems.