This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
In this paper, the case of a cardboard box marketing firm is studied and a (R,s,Q,c) inventory replenishment policy is proposed and evaluated by means of discrete event simulation...
Carlos B. Ramirez Cerda, Armando J. Espinosa de lo...
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
- In this paper, we propose a thermal-aware job allocation and scheduling algorithm for three-dimensional (3D) chip multiprocessor (CMP). The proposed algorithm assigns hot jobs to...