English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

A single machine produces several difierent classes of items in a make-to-stock mode. We consider the problem of scheduling the machine to regulate flnished goods inventory, minimizing holding and backorder or holding and lost sales costs. Demands are Poisson, service times are exponentially distributed, and there are no delays or costs associated with switching products. A scheduling policy dictates whether the machine is idle or busy, and specifles the job class to serve in the latter case. Since the optimal solution can only be numerically computed for problems with several products, our goal is to develop efiective policies that are computationally tractable for a large number of products. We develop index policies to decide which class to produce, including Whittle's \restless bandit" index, which possesses a certain asymptotic optimality. Several idleness policies are derived, and the best policy is obtained from a heavy tra-c difiusion approximation. Nine sample problems are considered in a numerical study, and the average suboptimality of the best policy is less than 3%.

Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points