IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v287y2020i3p916-928.html
   My bibliography  Save this article

Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs

Author

Listed:
  • uit het Broek, Michiel A.J.
  • Van der Heide, Gerlach
  • Van Foreest, Nicky D.

Abstract

There are numerous practical examples of production systems with servers that require heating in order to process jobs. Such production systems may realize considerable energy savings by temporarily switching off the heater and building up a queue of jobs to be processed later, at the expense of extra queueing costs. In this paper, we optimize this trade-off between energy and queueing costs. We model the production system as an M/G/1 queue with a temperature controlled server that can only process jobs if a minimum production temperature is satisfied. The time and energy required to heat a server depend on its current temperature, hence the setup times and setup costs for starting production are state dependent. We derive the optimal policy structure for a fluid queue approximation, called a wait-heat-clear policy. Building upon these insights, for the M/G/1 queue we derive exact and approximate costs for various intuitive types of wait-heat-clear policies. Numerical results indicate that the optimal wait-heat-clear policy yields average cost savings of over 40% compared to always keeping the server at the minimum production temperature. Furthermore, an encouraging result for practice is that simple heuristics, depending on the queue length only, have near-optimal performance.

Suggested Citation

  • uit het Broek, Michiel A.J. & Van der Heide, Gerlach & Van Foreest, Nicky D., 2020. "Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs," European Journal of Operational Research, Elsevier, vol. 287(3), pages 916-928.
  • Handle: RePEc:eee:ejores:v:287:y:2020:i:3:p:916-928
    DOI: 10.1016/j.ejor.2020.03.021
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2020.03.021?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. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. Nesello, Vitor & Subramanian, Anand & Battarra, Maria & Laporte, Gilbert, 2018. "Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 266(2), pages 498-507.
    3. K. R. Balachandran, 1973. "Control Policies for a Single Server System," Management Science, INFORMS, vol. 19(9), pages 1013-1018, May.
    4. Daniel P. Heyman, 1977. "The T-Policy for the M/G/1 Queue," Management Science, INFORMS, vol. 23(7), pages 775-778, March.
    5. Naishuo Tian & Zhe George Zhang, 2006. "Vacation Queueing Models Theory and Applications," International Series in Operations Research and Management Science, Springer, number 978-0-387-33723-4, December.
    6. Peter D. Welch, 1964. "On a Generalized M / G /1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service," Operations Research, INFORMS, vol. 12(5), pages 736-752, October.
    7. Wei-Min Lan & Tava Lennon Olsen, 2006. "Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules," Operations Research, INFORMS, vol. 54(3), pages 505-522, June.
    8. 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.
    9. Tuan Phung-Duc, 2017. "Exact solutions for M/M/c/Setup queues," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(2), pages 309-324, February.
    10. Shen, Liji & Dauzère-Pérès, Stéphane & Neufeld, Janis S., 2018. "Solving the flexible job shop scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 265(2), pages 503-516.
    11. Zhang, Zhe George & Tadj, Lotfi & Bounkhel, Messaoud, 2011. "Cost evaluation in M/G/1 queue with T-policy revisited, technical note," European Journal of Operational Research, Elsevier, vol. 214(3), pages 814-817, November.
    12. Naishuo Tian & Zhe George Zhang, 2006. "Applications of Vacation Models," International Series in Operations Research & Management Science, in: Vacation Queueing Models Theory and Applications, chapter 0, pages 343-358, Springer.
    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. Tan, Barış & Karabağ, Oktay & Khayyati, Siamak, 2023. "Production and energy mode control of a production-inventory system," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1176-1187.

    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. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    2. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    3. Zhang, Xuelu & Wang, Jinting & Do, Tien Van, 2015. "Threshold properties of the M/M/1 queue under T-policy with applications," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 284-301.
    4. Zhang, Zhe George & Tadj, Lotfi & Bounkhel, Messaoud, 2011. "Cost evaluation in M/G/1 queue with T-policy revisited, technical note," European Journal of Operational Research, Elsevier, vol. 214(3), pages 814-817, November.
    5. Miaomiao Yu & Attahiru Sule Alfa, 2016. "Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue," Operational Research, Springer, vol. 16(2), pages 161-179, July.
    6. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    7. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    8. Yuying Zhang & Dequan Yue & Wuyi Yue, 2022. "A queueing-inventory system with random order size policy and server vacations," Annals of Operations Research, Springer, vol. 310(2), pages 595-620, March.
    9. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    10. Yi Peng & Jinbiao Wu, 2020. "A Lévy-Driven Stochastic Queueing System with Server Breakdowns and Vacations," Mathematics, MDPI, vol. 8(8), pages 1-12, July.
    11. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    12. Srinivas R. Chakravarthy & Serife Ozkar, 2016. "Crowdsourcing and Stochastic Modeling," Business and Management Research, Business and Management Research, Sciedu Press, vol. 5(2), pages 19-30, June.
    13. Zsolt Saffer & Sergey Andreev & Yevgeni Koucheryavy, 2016. "$$M/D^{[y]}/1$$ M / D [ y ] / 1 Periodically gated vacation model and its application to IEEE 802.16 network," Annals of Operations Research, Springer, vol. 239(2), pages 497-520, April.
    14. Timo Gschwind & Stefan Irnich & Christian Tilk & Simon Emde, 2020. "Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network," Journal of Scheduling, Springer, vol. 23(3), pages 363-377, June.
    15. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    16. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    17. Shunfu Jin & Xiuchen Qie & Wenjuan Zhao & Wuyi Yue & Yutaka Takahashi, 2020. "A clustered virtual machine allocation strategy based on a sleep-mode with wake-up threshold in a cloud environment," Annals of Operations Research, Springer, vol. 293(1), pages 193-212, October.
    18. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    19. Amina Angelika Bouchentouf & Abdelhak Guendouzi, 2021. "Single Server Batch Arrival Bernoulli Feedback Queueing System with Waiting Server, K-Variant Vacations and Impatient Customers," SN Operations Research Forum, Springer, vol. 2(1), pages 1-23, March.
    20. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.

    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:ejores:v:287:y:2020:i:3:p:916-928. 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/eor .

    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.