This paper describes a new solution for an order dispatching problem (ODP) within a distributed manufacturing environment. A mathematical model has been developed to describe the ODP, including both assigning orders to manufacturers and determining the completion times while satisfying a set of constraints. This model has two types of variables: 0-1 decision variables and integer variables that make it a non-linear mixed-variables integer programming model. The usage rate of parts inventory is taken into consideration to avoid parts devaluation. To solve the problem, a novel hybrid genetic algorithm (GA) with a new evolution strategy has been introduced. The hybrid GA can provide more survival chances in the evolving competition for outstan...
Dispatching rules play an important role especially in semiconductor manufacturing scheduling, becau...
The paper proposes a solution to a class of scheduling problems where the goal is to minimize the sc...
Job shop scheduling (JSS) problems are difficult combinatorial optimisation problems that have been ...
This paper proposes a mixed integer-programming model for the order planning. The genetic algorithm ...
In this paper, the order scheduling problem at the factory level, aiming at scheduling the productio...
This paper presents a system that uses robust, genetic algorithms for solving job shop scheduling pr...
In this study, the customer order scheduling problem is investigated to minimize total weighted comp...
The order batching problem is a combinatorial optimization problem that arises in the warehouse orde...
Nowadays, the application of effective and efficient decisions on complex issues require the use of ...
Many firms have to deal with the problems of scheduling and transportation allocation. The problems ...
In competitive business, one of the challenges of management in industrial units is reducing the pri...
Coordination is essential for improving supply chain performance, and one of the most critical facto...
This paper introduces a grouped genetic algorithm (GGA) to solve the order batching and sequencing p...
Order scheduling is the process of organizing and arranging orders to be fulfilled by a certain time...
This paper develops a multi-criterion genetic optimization procedure, specifically designed for solv...
Dispatching rules play an important role especially in semiconductor manufacturing scheduling, becau...
The paper proposes a solution to a class of scheduling problems where the goal is to minimize the sc...
Job shop scheduling (JSS) problems are difficult combinatorial optimisation problems that have been ...
This paper proposes a mixed integer-programming model for the order planning. The genetic algorithm ...
In this paper, the order scheduling problem at the factory level, aiming at scheduling the productio...
This paper presents a system that uses robust, genetic algorithms for solving job shop scheduling pr...
In this study, the customer order scheduling problem is investigated to minimize total weighted comp...
The order batching problem is a combinatorial optimization problem that arises in the warehouse orde...
Nowadays, the application of effective and efficient decisions on complex issues require the use of ...
Many firms have to deal with the problems of scheduling and transportation allocation. The problems ...
In competitive business, one of the challenges of management in industrial units is reducing the pri...
Coordination is essential for improving supply chain performance, and one of the most critical facto...
This paper introduces a grouped genetic algorithm (GGA) to solve the order batching and sequencing p...
Order scheduling is the process of organizing and arranging orders to be fulfilled by a certain time...
This paper develops a multi-criterion genetic optimization procedure, specifically designed for solv...
Dispatching rules play an important role especially in semiconductor manufacturing scheduling, becau...
The paper proposes a solution to a class of scheduling problems where the goal is to minimize the sc...
Job shop scheduling (JSS) problems are difficult combinatorial optimisation problems that have been ...