Heuristics for multimachine scheduling problems with earliness and tardiness costs

Article Abstract:

The just-in-time scheduling problem on multiple parallel machines is explored. The study starts by considering problems where each job's cost is defined by a common but general nondecreasing, convex function F of the absolute deviation of its completion time from an non-restrictive due date, with the objective of minimizing the sum of the costs incurred for all jobs. A lower bound for the optimum-cost value and a simple alternating-schedule heuristic are derived, both of which can be computed in O(N log N) time. The lower bound is tight for some problems while the heuristic leads to an optimal solution. A numerical analysis shows that the average gap is lower than 1% even for problems with 30 jobs and is lower than 0.1% for problems with 90 or more jobs. Regression analysis also affirms that the empirical gap is almost fully proportional with N (raised to the power of -2).

Scheduling (Management), Calendar

---

Approximations of Dynamic, Multilocation Production and Inventory Problems

Article Abstract:

A model is developed for a single-location inventory problem. The system examined consists of a central depot which supplies J locations where exogenous, random demands for a single commodity must be filled. No inventory is carried at the depot. The model can be a two-stage production process or a single-stage multiproduct system. Centralized ordering offers the advantages of economics of scale and the postponement of allocation decisions. Special cases and extensions are presented. The literature is reviewed.

Stochastic processes, Inventories

---

Approximations of Dynamic, Multilocation Production and Inventory Problems

Article Abstract:

A central depot supplying several locations with random demands is studied. The depot has no inventory. Orders are received and allocated among the several locations. Back orders can occur. Linear costs are assumed for holding inventory and back orders. The total cost is to be minimized with a dynamic program. Tables of computational results are available.

Management science, Inventory control, Dynamic programming, Curve fitting, Production, Simulation, Stochastic Model, Approximation, Time Series

Similar abstracts:

• Abstracts: Performance implications of strategic fit between alliance attributes and alliance forms. Outsourcing service activities
• Abstracts: A structural equation model of new product design and development. The role of existing knowledge in new product innovativeness and performance
• Abstracts: An Approach to the Optimal Positioning of a New Product. Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Abstracts: An Experiment in Futility. Polishing Your Financial Image. BanCal Has No Yen for Wells Fargo
• Abstracts: White Goods Are Red-Hot. No More Aluminum Ghettos. Can That be Sterling Stirring?

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