Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Optimization (18)
- Scheduling (13)
- Vehicle routing problem (13)
- Reinforcement learning (9)
- Logistics (8)
-
- Uncertainty (8)
- MITB student (7)
- Tabu search (7)
- Adaptive large neighborhood search (6)
- Multi-agent systems (6)
- Orienteering Problem (6)
- Vehicle routing (6)
- Combinatorial optimization (5)
- Orienteering problem (5)
- Time windows (5)
- Algorithms (4)
- Artificial intelligence (4)
- Cross-docking (4)
- Decision making (4)
- Genetic algorithm (4)
- Iterated Local Search (4)
- Mobile crowdsourcing (4)
- Multi agent systems (4)
- Routing (4)
- Simulated Annealing (4)
- Singapore (4)
- Analytical models (3)
- Auction (3)
- Constrained optimization (3)
- Deep learning (3)
- Publication Year
- Publication
- Publication Type
Articles 361 - 362 of 362
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew
Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew
Research Collection School Of Computing and Information Systems
We present ROMAN, a comprehensive, generic manpower rostering toolkit that successfully handles a wide spectrum of work policies found in service organizations. We review the use of various techniques and methodologies in the toolkit that contribute to its robustness and efficiency, and relate experience gained in addressing manpower rostering problems in industry.
Deterministic Approximations To Co-Production Problems With Service Constraints And Random Yields, Gabriel R. Bitran, Thin Yin Leong
Deterministic Approximations To Co-Production Problems With Service Constraints And Random Yields, Gabriel R. Bitran, Thin Yin Leong
Research Collection School Of Computing and Information Systems
Production planning problems where multiple item categories are produced simultaneously are examined. The items have random yields and are used to satisfy the demands of many products. These products have specification requirements that overlap. An item originally targeted to satisfy the demand of one product may be used to satisfy the demand of other products when it conforms to their specifications. Customers' demand must be satisfied from inventory. The problem is formulated with service constraints and a near-optimal solution is provided to the problem with a fixed planning horizon. Simple heuristics are proposed for the problem solved with a rolling …