We compare several techniques for scheduling shipment of customer orders for the Coors Brewing warehouse and production line. The goal is to minimize time at dock for trucks and railcars while also minimizing inventory. The techniques include a genetic algorithm, local search operators, heuristic rules, systematic search and hybrid approaches. Initial results show a hybrid genetic algorithm to be superior to the other methods. The evaluation function is a fast approximate form of a warehouse simulation. We also assess the sensitivity of the search algorithms to noise in an approximate evaluation function using a more detailed (and costly) simulation. I
Production scheduling is a branch of operational research that uses discrete approaches to address a...
Genetic algorithms are a very popular heuristic which have been suc-cessfully applied to many optimi...
In this paper the differences in performance of heuristic and optimal strategies for routing orderpi...
In the last decade, simulation software as a tool for managing and controlling business processes ha...
Manufacturing organizations of the present time are facing the challenge of satisfying the higher ex...
This paper explores the use of a genetic algorithm (GA) to optimise item allocation in a warehouse, ...
The order batching problem is a combinatorial optimization problem that arises in the warehouse orde...
The main aim of this thesis is flow shop and job shop scheduling problem in logistics warehouses. Ma...
This paper presents possible ways to improve enterprises’ scheduling, simplified as Job-Shop Schedul...
This paper describes the application of a metaheuristic to a real problem that arises within the dom...
We deal with the joint replenishment and delivery scheduling of the one-warehouse, n-retailer system...
Warehouses are important links in the supply chain; here, products are temporarily stored and retrie...
The job shop problem is among the class of NP- hard combinatorial problems. This Research paper addr...
In the last years, the diffusion of lean thinking had a big impact, not only in manufacturing, but i...
This article aims to develop a genetic algorithm to minimize the distance traveled in warehouses and...
Production scheduling is a branch of operational research that uses discrete approaches to address a...
Genetic algorithms are a very popular heuristic which have been suc-cessfully applied to many optimi...
In this paper the differences in performance of heuristic and optimal strategies for routing orderpi...
In the last decade, simulation software as a tool for managing and controlling business processes ha...
Manufacturing organizations of the present time are facing the challenge of satisfying the higher ex...
This paper explores the use of a genetic algorithm (GA) to optimise item allocation in a warehouse, ...
The order batching problem is a combinatorial optimization problem that arises in the warehouse orde...
The main aim of this thesis is flow shop and job shop scheduling problem in logistics warehouses. Ma...
This paper presents possible ways to improve enterprises’ scheduling, simplified as Job-Shop Schedul...
This paper describes the application of a metaheuristic to a real problem that arises within the dom...
We deal with the joint replenishment and delivery scheduling of the one-warehouse, n-retailer system...
Warehouses are important links in the supply chain; here, products are temporarily stored and retrie...
The job shop problem is among the class of NP- hard combinatorial problems. This Research paper addr...
In the last years, the diffusion of lean thinking had a big impact, not only in manufacturing, but i...
This article aims to develop a genetic algorithm to minimize the distance traveled in warehouses and...
Production scheduling is a branch of operational research that uses discrete approaches to address a...
Genetic algorithms are a very popular heuristic which have been suc-cessfully applied to many optimi...
In this paper the differences in performance of heuristic and optimal strategies for routing orderpi...