Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
Annals of Operations Research - Special issue on Tabu search
Computers and Operations Research
Heuristic algorithms for the two-stage hybrid flowshop problem
Operations Research Letters
Integrated Production and Delivery Scheduling with Disjoint Windows
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Computers and Operations Research
The Coordination of Pricing and Scheduling Decisions
Manufacturing & Service Operations Management
Integrated production and delivery scheduling with disjoint windows
Discrete Applied Mathematics
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Theoretical Computer Science
Hi-index | 0.00 |
This paper deals with the problem of selecting and scheduling the orders to be processed by a manufacturing plant for immediate delivery to the customer site. Among the constraints to be considered are the limited production capacity, the available number of vehicles and the time windows within which orders must be served. We first describe the problem as it occurs in practice in some industrial environments, and then present an integer programming model that maximizes the profit due to the customer orders to be processed. A tabu search-based solution procedure to solve this problem is developed and tested empirically with randomly generated problems. Comparisons with an exact procedure show that the method finds very good-quality solutions with small computation requirements.