Skip to main content
Log in

On Reworks in a Serial Process with Flexible Windows of Time

  • Original Research
  • Published:
Operations Research Forum Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Data Availability

This article as no associated data.

References

  1. Collins M, Cooper L, Helgason R, Kennington J, LeBlanc L (1978) Solving the pipe network analysis problem using optimization techniques. Manag Sci 24:747–760

    Article  Google Scholar 

  2. Schadschneider A (2000) Statistical physics of traffic flow. Physica A: Statistical Mechanics and its Applications 285:101–120

    Article  Google Scholar 

  3. Schrijver A (2002) On the history of the transportation and maximum flow problems. Math Program 91:437–445

    Article  Google Scholar 

  4. Lee H, Yano C (1988) Production control in multistage systems with variable yield losses. Oper Res 36:269–278

    Article  Google Scholar 

  5. Liu J, Yang P (1996) Optimal lot-sizing in an imperfect production system with homogeneous reworkable jobs. Eur J Oper Res 91:517–527

    Article  Google Scholar 

  6. Turpin L (2018) A note on understanding cycle time. Int J Prod Res 205:113–117

    Google Scholar 

  7. Graves S (2002) Six sigma rolled throughput yield. Qual Eng 14:257–266

    Article  Google Scholar 

  8. Little J (1961) A proof for the queuing formula: \(L = \lambda W\). Operations research 9:383–387

    Article  Google Scholar 

  9. Dallery Y, Gershwin S (1992) Manufacturing flow line systems: a review of models and analytical results. Queueing Systems 12:3–94

    Article  Google Scholar 

  10. Crawford K, Cox J (1990) Designing performance measurement systems for just-in-time operations. Int J Prod Res 28:2025–2036

    Article  Google Scholar 

  11. Klein M (1966) Markovian decision models for reject allowance problems. Manag Sci 12:349–358

    Article  Google Scholar 

Download references

Funding

No funding was received for this work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lonnie Turpin Jr..

Ethics declarations

Conflicts of Interest

The authors declare that there is no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Turpin, L., Brown, B. On Reworks in a Serial Process with Flexible Windows of Time. SN Oper. Res. Forum 2, 22 (2021). https://doi.org/10.1007/s43069-021-00066-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s43069-021-00066-z

Keywords

Navigation