New saving based algorithms for time constrained pickup and delivery of full truckloads

Article Abstract:

The problem with the pickup of full truckloads under time window constraints is dealt. A relaxed problem formulation based on network flows, which can be used to calculate a lower bound to the solution value is also given.

Services information, Transportation, Power-Driven Handtool Manufacturing, Power-driven handtools, Power Hand Planes & Routers, Services, Routing-machines, Routers (Woodworking)

---

A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case

Article Abstract:

A heuristic and an optimal algorithm to study the economic lot and delivery scheduling problem in case of a common cycle are proposed.

Denmark, Models, Algorithms, Algorithm, Economic lot size

---

Negotiation-based collaborative planning between supply chains partners

Article Abstract:

A non-hierarchical negotiation-based operations planning between supply chains partners is suggested.

Germany, Negotiation, mediation and arbitration, Business-to-business market, Business to business market

Similar abstracts:

• Abstracts: Three approximation algorithms for solving the generalized segregated storage problem. The interactive analysis of the multicriteria shortest path problem by the reference point method
• Abstracts: A heuristic approach for capacity expansion of packet networks. Analysis of heuristic solutions to the best choice problem
• Abstracts: Primary and secondary route selection in backbone communication networks. Model selection in Neural Networks: some difficulties

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.