IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v147y2014ipcp634-646.html
   My bibliography  Save this article

Investigating the impact of operational variables on manufacturing cost by simulation optimization

Author

Listed:
  • Zhang, Rui
  • Chiang, Wen-Chyuan
  • Wu, Cheng

Abstract

In this paper, we focus on the relationship between operations-based variables (specifically, production speed, scrap rate and maintenance speed) and the manufacturing cost. These variables usually produce opposite influences on the variable cost and the fixed cost. For example, setting the production speed at a high level is beneficial for reducing the variable cost. However, maintaining the high speed incurs considerable fixed costs at the same time. Therefore, an optimization approach is necessary to determine the optimal values of the operational variables for minimizing the average cost. First, a discrete-event simulation procedure is designed for describing the stochastic production environment and for evaluating the settings. Then, an optimization approach based on the ordinal optimization (OO) philosophy and particle swarm optimization (PSO) is used to search in the continuous space of the operational variables. In this process, the optimal computing budget allocation technique is applied so as to fully utilize the computational resource and potentially save the computational time. Finally, numeric computations are conducted for verifying the effectiveness of the proposed algorithm. Sensitivity analysis and discussions are also presented.

Suggested Citation

  • Zhang, Rui & Chiang, Wen-Chyuan & Wu, Cheng, 2014. "Investigating the impact of operational variables on manufacturing cost by simulation optimization," International Journal of Production Economics, Elsevier, vol. 147(PC), pages 634-646.
  • Handle: RePEc:eee:proeco:v:147:y:2014:i:pc:p:634-646
    DOI: 10.1016/j.ijpe.2013.04.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527313001825
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ijpe.2013.04.018?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. Biskup, Dirk & Herrmann, Jan & Gupta, Jatinder N.D., 2008. "Scheduling identical parallel machines to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 115(1), pages 134-142, September.
    2. Damodaran, Purushothaman & Kumar Manjeshwar, Praveen & Srihari, Krishnaswami, 2006. "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 103(2), pages 882-891, October.
    3. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
    4. Andreas Soteriou & Stavros A. Zenios, 1999. "Operations, Quality, and Profitability in the Provision of Banking Services," Management Science, INFORMS, vol. 45(9), pages 1221-1238, September.
    5. Haouari, Mohamed & Hidri, Lotfi, 2008. "On the hybrid flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 113(1), pages 495-497, May.
    6. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    7. Wang, J.-B. & Ng, C.T. & Cheng, T.C.E. & Liu, L.L., 2008. "Single-machine scheduling with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 111(2), pages 802-811, February.
    8. Chun-Hung Chen & Enver Yücesan & Liyi Dai & Hsiao-Chang Chen, 2010. "Optimal budget allocation for discrete-event simulation experiments," IISE Transactions, Taylor & Francis Journals, vol. 42(1), pages 60-70.
    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. Cheng, Shuenn-Ren, 2014. "Some new problems on two-agent scheduling to minimize the earliness costs," International Journal of Production Economics, Elsevier, vol. 156(C), pages 24-30.
    2. Guo, Chiquan & Wang, Yong J. & Metcalf, Ashley, 2014. "How to calibrate conventional market-oriented organizational culture in 21st century production-centered firms? A customer relationship perspective," International Journal of Production Economics, Elsevier, vol. 156(C), pages 235-245.

    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. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Wang, Jun-Qiang & Leung, Joseph Y.-T., 2014. "Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan," International Journal of Production Economics, Elsevier, vol. 156(C), pages 325-331.
    3. Muter, İbrahim, 2020. "Exact algorithms to minimize makespan on single and parallel batch processing machines," European Journal of Operational Research, Elsevier, vol. 285(2), pages 470-483.
    4. Zhou, Shengchao & Liu, Ming & Chen, Huaping & Li, Xueping, 2016. "An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes," International Journal of Production Economics, Elsevier, vol. 179(C), pages 1-11.
    5. Zhou, Shengchao & Xie, Jianhui & Du, Ni & Pang, Yan, 2018. "A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 254-268.
    6. Hadi Mokhtari & Amir Noroozi, 2018. "An efficient chaotic based PSO for earliness/tardiness optimization in a batch processing flow shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(5), pages 1063-1081, June.
    7. Xu, Rui & Chen, Huaping & Li, Xueping, 2013. "A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system," International Journal of Production Economics, Elsevier, vol. 145(1), pages 371-386.
    8. Li, Xueping & Zhang, Kaike, 2018. "Single batch processing machine scheduling with two-dimensional bin packing constraints," International Journal of Production Economics, Elsevier, vol. 196(C), pages 113-121.
    9. Jia, Zhao-hong & Leung, Joseph Y.-T., 2015. "A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes," European Journal of Operational Research, Elsevier, vol. 240(3), pages 649-665.
    10. Baoyu Liao & Qingru Song & Jun Pei & Shanlin Yang & Panos M. Pardalos, 2020. "Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration," Journal of Global Optimization, Springer, vol. 78(4), pages 717-742, December.
    11. Wang, Jun-Qiang & Fan, Guo-Qiang & Zhang, Yingqian & Zhang, Cheng-Wu & Leung, Joseph Y.-T., 2017. "Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 258(2), pages 478-490.
    12. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    13. A Mukherjee & P Nath & M Pal, 2003. "Resource, service quality and performance triad: a framework for measuring efficiency of banking services," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(7), pages 723-735, July.
    14. Samet Güner & Erman Coşkun, 2016. "Determining the best performing benchmarks for transit routes with a multi-objective model: the implementation and a critique of the two-model approach," Public Transport, Springer, vol. 8(2), pages 205-224, September.
    15. Dongni Li & Xianwen Meng & Miao Li & Yunna Tian, 2016. "An ACO-based intercell scheduling approach for job shop cells with multiple single processing machines and one batch processing machine," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 283-296, April.
    16. Fethi, Meryem Duygun & Pasiouras, Fotios, 2010. "Assessing bank efficiency and performance with operational research and artificial intelligence techniques: A survey," European Journal of Operational Research, Elsevier, vol. 204(2), pages 189-198, July.
    17. Moslehpour, Massoud & Lin, Yi Hsin & Nguyen, Thi Le Huyen, 2017. "Top purchase intention priorities of Vietnamese LCC passengers: Expectations and satisfaction," MPRA Paper 81635, University Library of Munich, Germany.
    18. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    19. Pejman Ebrahimi & Maria Fekete-Farkas & Parisa Bouzari & Róbert Magda, 2021. "Financial Performance of Iranian Banks from 2013 to 2019: A Panel Data Approach," JRFM, MDPI, vol. 14(6), pages 1-15, June.
    20. Olafsson, Sigurdur & Li, Xiaonan, 2010. "Learning effective new single machine dispatching rules from optimal scheduling data," International Journal of Production Economics, Elsevier, vol. 128(1), pages 118-126, November.

    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:proeco:v:147:y:2014:i:pc:p:634-646. 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/locate/ijpe .

    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.