A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem

Article Abstract:

A forward branch-and-search algorithm with forecast horizon results is developed for the problem of scheduling several products with dynamic, deterministic requirements on a single, finite-capacity resource. The goal is to minimize the total changeover expense. Several properties of the optimal solutions are used to construct an efficient forward-time branch-and-search algorithm to solve the problem. An analogy is also made between the regeneration sets in the dynamic lot sizing literature and the active nodes on the branch-and-search tree.

Models, Usage, Scheduling (Management), Algorithms, Forecasting

---

Coordinated ordering decisions for short life cycle products with uncertainty in delivery time and demand

Article Abstract:

A two-party system, in which the buyer orders a product from the supplier, whose delivery time is uncertain, is identified. The supplier aims to deliver the product at the start of the selling period, and if the delivery is late the buyer is compensated by the supplier.

Contracts & orders received, Courier Services, Security Guards and Patrol Services, Management dynamics, Contracts & orders let, Detective & armored car services, Management, Delivery services, Contracts, Contract agreement, Logistics, Business logistics, Company business management, Product life cycle

---

Similar abstracts:

• Abstracts: A fast and effective heuristic for the orienteering problem. A computational study of smoothing heuristics for the traveling salesman problem
• Abstracts: A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Load balancing and capacity constraints in a hierarchical location model
• Abstracts: An exact algorithm for the knapsack sharing problem with common items. Heuristic and exact algorithms for the simultaneous assignment problem
• Abstracts: A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
• Abstracts: On not-first/not-last conditions in disjunctive scheduling. Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

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