Feasibility of scheduling lot sizes of three products on one machine

Article Abstract:

The General Feasibility Problem within the Economic Lot Scheduling Problem is analyzed. The problem under consideration pertains to the determination of a viable schedule for reducing holding and set up costs through the cyclic manufacturing of a number of products on one machine. Specifically, the problem is considered in the case wherein there are three products that need to be manufactured in a particular fixed lot size at even intervals. An arithmetic test is developed to determine if a feasible schedule for such a case does exist. A procedure for developing these feasible schedules is also presented.

Scheduling (Management)

---

Lot-sizing and sequencing delays

Article Abstract:

Time performance in production scheduling is usually considered to be the province of sequencing models, which take task processing times to be given. Processing times in practice can often be managed by selection of lot sizes, which therefore have a major effect on makespan, waiting times, flow times, and other measures. The connection between lot sizing and sequencing is introduced, and the effect of lot sizes on flow times and makespan is analyzed qualitatively.

---

Similar abstracts:

• Abstracts: Lot sizes, lead times and in-process inventories. Approximations for a lost-sales production-inventory control model with service level constraints
• Abstracts: Comparing hierarchical and nonhierarchical weighting methods for eliciting multiattribute value models. The effects of splitting attributes on weights in multivariate utility measurement
• Abstracts: Modeling integrative, multiple issue bargaining. Resolving a conflict situation with a reference outcome: an axiomatic model

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