Skip to main content
SpringerLink
Log in

Lot-Sizing and Sequencing on a Single Imperfect Machine

  • Conference paper
Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 14))

Abstract

We study a problem of lot-sizing and sequencing several discrete products on a single machine. A sequence dependent setup time is required between the lots of different products. The machine is imperfect in the sense that it can produce defective items, and furthermore breakdown. The number of the defective items for each product is given as an integer valued non-decreasing function of the manufactured quantity for this product. The total machine breakdown time is given as a real valued non-decreasing function of the manufactured quantities of all the products. The objective is to minimize the total cost of the demand dissatisfaction, provided that a given upper bound on the completion time for the last item has been satisfied.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. European Journal of Operational Research (in press) Available online 13 November 2006

    Google Scholar 

  2. Buscher, U., Lindner, G.: Optimizing a production system with rework and equal sized batch shipments. Computers & Operations Research 34, 515–535 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cheng, T.C.E., Kovalyov, M.Y.: An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. Computers & Operations Research 29, 2087–2091 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chiu, S.W., Ting, C.-K., Chiu, Y.-S.P.: Optimal production lot sizing with rework, scrap rate, and service level constraint. Mathematical and Computer Modelling 46, 535–549 (2007)

    Article  Google Scholar 

  5. Chubanov, S., Kovalyov, M.Y., Pesch, E.: An FPTAS for a single-item capacitated economic lotsizing problem. Mathematical Programming, Ser. A 106, 453–466 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dolgui, A., Levin, G., Louly, M.-A.: Decomposition approach for a problem of lotsizing and sequencing under uncertainties. International Journal of Computer Integrated Manufacturing 18, 376–385 (2005)

    Article  Google Scholar 

  7. Dolgui, A., Kovalyov, M.: Multi-product lot-sizing on an imperfect single machine, Research Report G2I 2007-500-009, Ecole des Mines de Saint Etienne, France, 16 pages (2007)

    Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Co., San Francisco (1979)

    MATH  Google Scholar 

  9. Groenevelt, H., Pintelon, L., Seidmann, A.: Production lot sizing with machine breakdowns. Management Science 38, 104–120 (1992)

    Article  MATH  Google Scholar 

  10. Flapper, S.D.P., Fransoo, J.C., Broekmeulen, R.A.C.M., Inderfurth, K.: Planning and control of rework in the process industries: a review. Production Planning & Control 1, 26–34 (2002)

    Article  Google Scholar 

  11. Inderfurth, K., Janiak, A., Kovalyov, M.Y., Werner, F.: Batching work and rework processes with limited deterioration of reworkables. Computers and Operations Research 33, 1595–1605 (2006)

    Article  MATH  Google Scholar 

  12. Inderfurth, K., Kovalyov, M.Y., Ng, C.T., Werner, F.: Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables. International Journal of Production Economics 105, 345–356 (2007)

    Article  Google Scholar 

  13. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics 10, 196–210 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kovalyov, M.Y.: A rounding technique to construct approximation algorithms for knapsack and partition type problems. Applied Mathematics and Computer Science 6, 101–113 (1996)

    MathSciNet  MATH  Google Scholar 

  15. Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: A review. European Journal of Operational Research 120, 228–249 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. Potts, C.N., Van Wassenhove, L.N.: Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of the Operational Research Society 43, 395–406 (1992)

    Article  MATH  Google Scholar 

  17. Rosenblatt, M.J., Lee, H.L.: Economic production cycles with imperfect production processes. IIE Transactions 18, 48–55 (1986)

    Article  Google Scholar 

  18. Tanaev, V.S., Kovalyov, M.Y., Shafransky, Y.M.: Scheduling Theory. Group Technologies, Minsk, IEC NANB (in Russian) (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering and Computer Science Centre (G2I), Ecole des Mines de Saint Etienne, 158, cours Fauriel, 42023, Saint Etienne Cedex 2, France

    Alexandre Dolgui, Mikhail Y. Kovalyov & Kseniya Shchamialiova

  2. Faculty of Economics, Belarusian State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus, Nezavisimosti 4, 220030, Minsk, Belarus

    Mikhail Y. Kovalyov

Authors
  1. Alexandre Dolgui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Y. Kovalyov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kseniya Shchamialiova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science, UFR MIM,, Paul Verlaine University of Metz, Metz, France

    Hoai An Le Thi

  2. Faculty of Sciences, Technology and Communications, University of Luxembourg, Luxembourg

    Pascal Bouvry

  3. Laboratory of Mathematics, National Institute for Applied Sciences, Rouen Mont, Saint Aignan, France

    Tao Pham Dinh

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dolgui, A., Kovalyov, M.Y., Shchamialiova, K. (2008). Lot-Sizing and Sequencing on a Single Imperfect Machine. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87477-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87476-8

  • Online ISBN: 978-3-540-87477-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation