Entity usage

Showing below up to 50 results in range #1 to #50.

1. A new approach to the learning effect: Beyond the learning curve restrictions: Label: en
2. An algorithm for ranking assignments using reoptimization: Label: en
3. Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties: Label: en
4. Capacitated single allocation hub location problem-A bi-criteria approach: Label: en
5. The impact of replenishment parameters and information sharing on the bullwhip effect: a computational study: Label: en
6. Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs: Label: en
7. A parallel multistart algorithm for the closest string problem: Label: en
8. An ant colony optimization algorithm for DNA sequencing by hybridization: Label: en
9. An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs: Label: en
10. The multi-weighted Steiner tree problem: A reformulation by intersection: Label: en
11. Buffer allocation in general single-server queueing networks: Label: en
12. Dynamic pricing, promotion and replenishment policies for a deteriorating item under permissible delay in payments: Label: en
13. Dynamic modeling and control of supply chain systems: A review: Label: en
14. Supply disruptions with time-dependent parameters: Label: en
15. Real-time prediction of order flowtimes using support vector regression: Label: en
16. An approximation manpower planning model for after-sales field service support: Label: en
17. Learning market prices in real-time supply chain management: Label: en
18. Real-time supply chain control via multi-agent adjustable autonomy: Label: en
19. The design of real-time logistics information system for trucking industry: Label: en
20. Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering: Label: en
21. A dynamic driver management scheme for less-than-truckload carriers: Label: en
22. A graph theoretic approach to non-anticipativity constraint generation in multistage stochastic programs with incomplete scenario sets: Label: en
23. Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand: Label: en
24. MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem: Label: en
25. Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions: Label: en
26. The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints: Label: en
27. Coordinating visit interval and safety stock decisions in a two-level supply chain with shelf-life considerations: Label: en
28. Distributionally robust facility location with bimodal random demand: Label: en
29. Semi-online scheduling: a survey: Label: en
30. Big data driven order-up-to level model: application of machine learning: Label: en
31. Large-scale periodic scheduling in time-sensitive networks: Label: en
32. Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine: Label: en
33. Visual attractiveness in vehicle routing via bi-objective optimization: Label: en
34. Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times: Label: en
35. Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics: Label: en
36. Replication and sequencing of unreliable jobs on parallel machines: Label: en
37. Faster maximum feasible subsystem solutions for dense constraint matrices: Label: en
38. High-dimensional black-box optimization under uncertainty: Label: en
39. A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances: Label: en
40. Benders decomposition for network design covering problems: Label: en
41. A time-space formulation for the locomotive routing problem at the Canadian National Railways: Label: en
42. Computing representations using hypervolume scalarizations: Label: en
43. Finite inventory budgets in production capacity and safety stock placement under the guaranteed service approach: Label: en
44. Optimization of the integrated problem of employee timetabling and job shop scheduling: Label: en
45. New formulations and branch-and-cut procedures for the longest induced path problem: Label: en
46. Dynamic dispatching for interbay automated material handling with lot targeting using improved parallel multiple-objective genetic algorithm: Label: en
47. Scheduling heterogeneous multi-load AGVs with battery constraints: Label: en
48. An improved genetic algorithm for the integrated satellite imaging and data transmission scheduling problem: Label: en
49. An iterative matheuristic for the inventory routing problem: Label: en
50. Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS: Label: en