Excerpt from The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies
We analyze two variants of the scheduling problem. In the setup cost problem, a cost is incurred when the machine switches production from one product to another; in the setup time problem, a random setup time is incurred when the server switches product. We restrict ourselves to the class of dynamic cyclic policies, where each product is serviced once per cycle and the order of production does not change. Thus, the server has three scheduling options at each point in time: Produce a unit of the product that is currently set up, change over to the next product in the cycle (and initiate service in the setup cost problem), or remain idle. Each product has its own costs per unit time for holding and backordering a unit in inventory. The objective in the setup time problem is to minimize the long run expected average inventory costs (that is, holding and backorder costs); the objective in the setup cost problem is to minimize the average inventory and setup costs.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sinopsis" puede pertenecer a otra edición de este libro.
Excerpt from The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies
We analyze two variants of the scheduling problem. In the setup cost problem, a cost is incurred when the machine switches production from one product to another; in the setup time problem, a random setup time is incurred when the server switches product. We restrict ourselves to the class of dynamic cyclic policies, where each product is serviced once per cycle and the order of production does not change. Thus, the server has three scheduling options at each point in time: Produce a unit of the product that is currently set up, change over to the next product in the cycle (and initiate service in the setup cost problem), or remain idle. Each product has its own costs per unit time for holding and backordering a unit in inventory. The objective in the setup time problem is to minimize the long run expected average inventory costs (that is, holding and backorder costs); the objective in the setup cost problem is to minimize the average inventory and setup costs.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Excerpt from The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies
We consider two queueing control problems that are stochastic versions of the economic lot scheduling problem: a single server processes N customer classes, and completed units enter a finished goods inventory that services exogenous customer demand. Unsatisfied demand is backordered, and each class has its own general service time distribution, renewal demand process, and holding and backordering cost rates. In the first problem, a setup cost is incurred when the server switches class, and the objective is to minimize the long run expected average costs of holding and backordering inventory and incurring setups. The setup cost is replaced by a setup time in the second problem, where the objective is to minimize average holding and backordering costs. In both problems we restrict ourselves to a class of dynamic cyclic policies, where idle periods and lot sizes are state-dependent, but the N classes must be served in a fixed sequence. Under standard heavy traffic conditions, these scheduling problems are approximated by diffusion control problems. The approximating setup cost problem is solved exactly, and the optimal dynamic lot sizing policy is found in closed form. Structural results and an algorithmic procedure are derived for the setup time problem. A computational study is undertaken to compare the proposed policy and several straw policies to the numerically computed optimal policy.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: New. Print on Demand. This book delves into the complex world of stochastic economic lot scheduling problems, a crucial aspect of manufacturing and inventory management. The author extends existing knowledge by examining two specific variants of the problem: setup costs and setup times, and their impact on scheduling. The book is groundbreaking in its use of diffusion control problems to approximate the setup cost problem, allowing for an exact solution. For the setup time problem, the author develops structural results and an algorithmic procedure to optimize the scheduling policy. The significance of this book lies in its provision of a deeper understanding of the stochastic economic lot scheduling problem, offering valuable insights for researchers, practitioners, and students in the fields of operations research, supply chain management, and manufacturing. The book's findings serve as a valuable contribution to the optimization of dynamic scheduling policies in real-world production and inventory systems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Nº de ref. del artículo: 9781332283088_0
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332283088
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332283088
Cantidad disponible: 15 disponibles