IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v38y2010i6p522-527.html
   My bibliography  Save this article

Batching for work and rework processes on dedicated facilities to minimize the makespan

Author

Listed:
  • Gribkovskaia, Irina V.
  • Kovalev, Sergey
  • Werner, Frank

Abstract

We study a planning problem of an imperfect production of a single product. The product is assumed to be continuously divisible. There are two facilities: a main facility dedicated to the original production and a facility dedicated to re-manufacturing defective units coming from the main facility. Units fabricated on the main facility are inspected for quality in batches. The quality inspection requires some time and can be performed on-line or off-line. After the inspection has been completed, defective units of the inspected batch are transported to the re-manufacturing facility. The transportation also requires some time. We assume that the fraction of the defective units is the same in each batch on the manufacturing facility and that the re-manufacturing facility is perfect. Given a demand for good quality units of the product and an upper bound K on the number of batches, the problem is to find a sequence of batch sizes such that the makespan, i.e., the time of the demand satisfaction, is minimized. We suggest a linear programming formulation, prove several properties of an optimal solution, and finally develop an time solution algorithm. A similar per time unit cost minimization problem is studied as well.

Suggested Citation

  • Gribkovskaia, Irina V. & Kovalev, Sergey & Werner, Frank, 2010. "Batching for work and rework processes on dedicated facilities to minimize the makespan," Omega, Elsevier, vol. 38(6), pages 522-527, December.
    • Handle: RePEc:eee:jomega:v:38:y:2010:i:6:p:522-527
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(10)00003-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Flapper, Simme Douwe P. & Teunter, Ruud H., 2004. "Logistic planning of rework with deteriorating work-in-process," International Journal of Production Economics, Elsevier, vol. 88(1), pages 51-59, March.
    2. 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.
    3. Huq, Faizul & Cutright, Kenneth & Martin, Clarence, 2004. "Employee scheduling and makespan minimization in a flow shop with multi-processor work stations: a case study," Omega, Elsevier, vol. 32(2), pages 121-129, April.
    4. Baker, KR & Jia, D, 1993. "A comparative study of lot streaming procedures," Omega, Elsevier, vol. 21(5), pages 561-566, September.
    5. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    6. Harry Groenevelt & Liliane Pintelon & Abraham Seidmann, 1992. "Production Lot Sizing with Machine Breakdowns," Management Science, INFORMS, vol. 38(1), pages 104-123, January.
    7. Teunter, Ruud & Kaparis, Konstantinos & Tang, Ou, 2008. "Multi-product economic lot scheduling problem with separate production lines for manufacturing and remanufacturing," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1241-1253, December.
    8. Tang, Lixin & Wang, Gongshu, 2008. "Decision support system for the batching problems of steelmaking and continuous-casting production," Omega, Elsevier, vol. 36(6), pages 976-991, December.
    9. Martin, Clarence H, 2009. "A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming," Omega, Elsevier, vol. 37(1), pages 126-137, February.
    10. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    11. Chiu, Huan Neng & Chang, Jen Huei, 2005. "Cost models for lot streaming in a multistage flow shop," Omega, Elsevier, vol. 33(5), pages 435-450, October.
    12. 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.
    13. Teunter, Ruud & Tang, Ou & Kaparis, Konstantinos, 2009. "Heuristics for the economic lot scheduling problem with returns," International Journal of Production Economics, Elsevier, vol. 118(1), pages 323-330, March.
    14. Fleischmann, Mortiz & Krikke, Hans Ronald & Dekker, Rommert & Flapper, Simme Douwe P., 2000. "A characterisation of logistics networks for product recovery," Omega, Elsevier, vol. 28(6), pages 653-666, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A. Beynaghi & F. Moztarzadeh & A. Shahmardan & R. Alizadeh & J. Salimi & M. Mozafari, 2019. "Makespan minimization for batching work and rework process on a single facility with an aging effect: a hybrid meta-heuristic algorithm for sustainable production management," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 33-45, January.
    2. Cheng, Bayi & Zhu, Huijun & Li, Kai & Li, Yongjun, 2019. "Optimization of batch operations with a truncated batch-position-based learning effect," Omega, Elsevier, vol. 85(C), pages 134-143.
    3. Marvizadeh, S. Zamiri & Choobineh, F.F., 2013. "Reducing the number of setups for CNC punch presses," Omega, Elsevier, vol. 41(2), pages 226-235.
    4. Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
    5. Cheng, Bayi & Leung, Joseph Y.-T. & Li, Kai & Yang, Shanlin, 2019. "Integrated optimization of material supplying, manufacturing, and product distribution: Models and fast algorithms," European Journal of Operational Research, Elsevier, vol. 277(1), pages 100-111.
    6. Hazen, Benjamin T. & Overstreet, Robert E. & Jones-Farmer, L. Allison & Field, Hubert S., 2012. "The role of ambiguity tolerance in consumer perception of remanufactured products," International Journal of Production Economics, Elsevier, vol. 135(2), pages 781-790.

    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. A. Dolgui & M. Kovalyov & K. Shchamialiova, 2011. "Multi-product lot-sizing and sequencing on a single imperfect machine," Computational Optimization and Applications, Springer, vol. 50(3), pages 465-482, December.
    2. Florian Jaehn & Sergey Kovalev & Mikhail Y. Kovalyov & Erwin Pesch, 2014. "Multiproduct batching and scheduling with buffered rework: The case of a car paint shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(6), pages 458-471, September.
    3. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    4. Harun Öztürk, 2021. "Optimal production run time for an imperfect production inventory system with rework, random breakdowns and inspection costs," Operational Research, Springer, vol. 21(1), pages 167-204, March.
    5. Andreas Goerler & Stefan Voß, 2016. "Dynamic lot-sizing with rework of defective items and minimum lot-size constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 54(8), pages 2284-2297, April.
    6. Shi-Sheng Li & Ren-Xia Chen & Qi Feng, 2016. "Scheduling two job families on a single machine with two competitive agents," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 784-799, October.
    7. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    8. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.
    9. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    10. Barketau, M.S. & Cheng, T.C.E. & Kovalyov, M.Y., 2008. "Batch scheduling of deteriorating reworkables," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1317-1326, September.
    11. Dolgui, Alexandre & Hashemi-Petroodi, S. Ehsan & Kovalev, Sergey & Kovalyov, Mikhail Y., 2021. "Profitability of a multi-model manufacturing line versus multiple dedicated lines," International Journal of Production Economics, Elsevier, vol. 236(C).
    12. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    13. D Biskup & M Feldmann, 2006. "Lot streaming with variable sublots: an integer programming formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 296-303, March.
    14. Sonntag, Danja & Kiesmüller, Gudrun P., 2018. "Disposal versus rework – Inventory control in a production system with random yield," European Journal of Operational Research, Elsevier, vol. 267(1), pages 138-149.
    15. Ji, Min & Cheng, T.C.E., 2010. "Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan," European Journal of Operational Research, Elsevier, vol. 202(1), pages 90-98, April.
    16. Widyadana, Gede Agus & Wee, Hui Ming, 2012. "An economic production quantity model for deteriorating items with multiple production setups and rework," International Journal of Production Economics, Elsevier, vol. 138(1), pages 62-67.
    17. Y H Kang & S S Kim & H J Shin, 2010. "A dispatching algorithm for parallel machines with rework processes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 144-155, January.
    18. Lele Zhang & Andrew Wirth, 2016. "Online Machine Scheduling with Family Setups," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-16, August.
    19. Sifaleras, Angelo & Konstantaras, Ioannis & Mladenović, Nenad, 2015. "Variable neighborhood search for the economic lot sizing problem with product returns and recovery," International Journal of Production Economics, Elsevier, vol. 160(C), pages 133-143.
    20. Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y. & Nossack, Jenny & Pesch, Erwin, 2014. "Minimizing setup costs in a transfer line design problem with sequential operation processing," International Journal of Production Economics, Elsevier, vol. 151(C), pages 186-194.

    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:eee:jomega:v:38:y:2010:i:6:p:522-527. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.