IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v2y2021i2d10.1007_s43069-021-00066-z.html
   My bibliography  Save this article

On Reworks in a Serial Process with Flexible Windows of Time

Author

Listed:
  • Lonnie Turpin

    (McNeese State University)

  • Barron Brown

    (Louisiana Tech University)

Abstract

Consider the planning of a multi-task serial production process where the prior task yields are continuous values determined from previous production data. Applying these values in the planning stage for the processing of discrete units does not necessarily guarantee a discrete input-output value for each task, thereby resulting in an approximate solution. Supposing the priors are conservative estimates, this research provides two simple models to determine these input–output values by discretizing the units at each task, thereby establishing a lower bound on the discrete output quantity (throughput). Both single- and multi-period models are presented where the multi-period model allows for reworks from previous time periods.

Suggested Citation

  • Lonnie Turpin & Barron Brown, 2021. "On Reworks in a Serial Process with Flexible Windows of Time," SN Operations Research Forum, Springer, vol. 2(2), pages 1-13, June.
  • Handle: RePEc:spr:snopef:v:2:y:2021:i:2:d:10.1007_s43069-021-00066-z
    DOI: 10.1007/s43069-021-00066-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-021-00066-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s43069-021-00066-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Liu, John J. & Yang, Ping, 1996. "Optimal lot-sizing in an imperfect production system with homogeneous reworkable jobs," European Journal of Operational Research, Elsevier, vol. 91(3), pages 517-527, June.
    2. Morton Klein, 1966. "Markovian Decision Models for Reject Allowance Problems," Management Science, INFORMS, vol. 12(5), pages 349-358, January.
    3. John D. C. Little, 1961. "A Proof for the Queuing Formula: L = (lambda) W," Operations Research, INFORMS, vol. 9(3), pages 383-387, June.
    4. Hau L. Lee & Candace Arai Yano, 1988. "Production Control in Multistage Systems with Variable Yield Losses," Operations Research, INFORMS, vol. 36(2), pages 269-278, April.
    5. Turpin, Lonnie, 2018. "A note on understanding cycle time," International Journal of Production Economics, Elsevier, vol. 205(C), pages 113-117.
    6. Schadschneider, Andreas, 2000. "Statistical physics of traffic flow," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 285(1), pages 101-120.
    7. M. Collins & L. Cooper & R. Helgason & J. Kennington & L. LeBlanc, 1978. "Solving the Pipe Network Analysis Problem Using Optimization Techniques," Management Science, INFORMS, vol. 24(7), pages 747-760, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, John J. & Yang, Ping, 1996. "Optimal lot-sizing in an imperfect production system with homogeneous reworkable jobs," European Journal of Operational Research, Elsevier, vol. 91(3), pages 517-527, June.
    2. Ching‐Chin Chern & Ping Yang, 1999. "Determining a threshold control policy for an imperfect production system with rework jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(3), pages 273-301, April.
    3. Grosfeld-Nir, Abraham, 1995. "Single bottleneck systems with proportional expected yields and rigid demand," European Journal of Operational Research, Elsevier, vol. 80(2), pages 297-307, January.
    4. Juhwen Hwang & Medini R. Singh, 1998. "Optimal Production Policies for Multi-Stage Systems with Setup Costs and Uncertain Capacities," Management Science, INFORMS, vol. 44(9), pages 1279-1294, September.
    5. Pham, An & Jin, Tongdan & Novoa, Clara & Qin, Jin, 2019. "A multi-site production and microgrid planning model for net-zero energy operations," International Journal of Production Economics, Elsevier, vol. 218(C), pages 260-274.
    6. Gullu, Refik, 1998. "Base stock policies for production/inventory problems with uncertain capacity levels," European Journal of Operational Research, Elsevier, vol. 105(1), pages 43-51, February.
    7. Yifan Liu & Lawrence M. Wein, 2008. "A Queueing Analysis to Determine How Many Additional Beds Are Needed for the Detention and Removal of Illegal Aliens," Management Science, INFORMS, vol. 54(1), pages 1-15, January.
    8. Hong, Sung-Pil & Kim, Taegyoon & Lee, Subin, 2019. "A precision pump schedule optimization for the water supply networks with small buffers," Omega, Elsevier, vol. 82(C), pages 24-37.
    9. W. Rogiest & K. Laevens & J. Walraevens & H. Bruneel, 2015. "Random-order-of-service for heterogeneous customers: waiting time analysis," Annals of Operations Research, Springer, vol. 226(1), pages 527-550, March.
    10. Chiu, Singa Wang, 2008. "Production lot size problem with failure in repair and backlogging derived without derivatives," European Journal of Operational Research, Elsevier, vol. 188(2), pages 610-615, July.
    11. Al-Salamah, Muhammad, 2019. "Economic production quantity in an imperfect manufacturing process with synchronous and asynchronous flexible rework rates," Operations Research Perspectives, Elsevier, vol. 6(C).
    12. Fränk Plein & Johannes Thürauf & Martine Labbé & Martin Schmidt, 2022. "A bilevel optimization approach to decide the feasibility of bookings in the European gas market," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(3), pages 409-449, June.
    13. Jinfa Chen & David D. Yao & Shaohui Zheng, 2001. "Optimal Replenishment and Rework with Multiple Unreliable Supply Sources," Operations Research, INFORMS, vol. 49(3), pages 430-443, June.
    14. Mehrdad Moshtagh & Jafar Fathali & James MacGregor Smith & Nezam Mahdavi-Amiri, 2019. "Finding an optimal core on a tree network with M/G/c/c state-dependent queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(1), pages 115-142, February.
    15. Qing Li & Shaohui Zheng, 2006. "Joint Inventory Replenishment and Pricing Control for Systems with Uncertain Yield and Demand," Operations Research, INFORMS, vol. 54(4), pages 696-705, August.
    16. Dailisan, Damian N. & Lim, May T., 2016. "Agent-based modeling of lane discipline in heterogeneous traffic," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 138-147.
    17. M. A. C. Almeida & F. R. B. Cruz & F. L. P. Oliveira & G. Souza, 2020. "Bias correction for estimation of performance measures of a Markovian queue," Operational Research, Springer, vol. 20(2), pages 943-958, June.
    18. Chen, Tsung-Hui & Tsao, Yu-Chung, 2014. "Optimal lot-sizing integration policy under learning and rework effects in a manufacturer–retailer chain," International Journal of Production Economics, Elsevier, vol. 155(C), pages 239-248.
    19. Pollock, Stephen M. & Golhar, Damodar, 1998. "The canning problem revisited: The case of capacitated production and fixed demand," European Journal of Operational Research, Elsevier, vol. 105(3), pages 475-482, March.
    20. Inderfurth, Karl & Kovalyov, Mikhail Y. & Ng, C.T. & Werner, Frank, 2007. "Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables," International Journal of Production Economics, Elsevier, vol. 105(2), pages 345-356, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:snopef:v:2:y:2021:i:2:d:10.1007_s43069-021-00066-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.