Skip to main content

Minimizing the Cost of Batch Calibrations

  • Conference paper
  • First Online:
  • 966 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11653))

Abstract

We study the scheduling problem with calibrations. We are given a set of n jobs that need to be scheduled on a set of m machines. However, a machine can schedule jobs only if a calibration has been performed beforehand and the machine is considered as valid during a fixed time period of T, after which it must be recalibrated before running more jobs. In this paper, we investigate the batch calibrations, calibrations occur in batch and at the same moment. It is then not possible to perform any calibrations during a period of T. We consider different cost function depending on the number of machines we calibrate at a given time. Moreover, jobs have release time, deadline and unit processing time. The objective is to schedule all jobs with the minimum cost of calibrations. We give a dynamic programming to solve the case with arbitrary cost function. Then, we propose several faster approximation algorithm for different cost function.

Vincent Chau is supported by Shenzhen research grants (KQJSCX 20180330170311901, JCYJ20180305180840138 and GGFW2017073114031767), NSFC (No. 61433012), Hong Kong GRF 17210017 and Shenzhen Discipline Construction Project for Urban Computing and Data Intelligence. Minming Li and Ruilong Zhang are supported by a grant from Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 11268616). Yingchao Zhao is supported by Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. UGC/FDS11/E03/16).

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Angel, E., Bampis, E., Chau, V., Zissimopoulos, V.: On the complexity of minimizing the total calibration cost. In: Xiao, M., Rosamond, F. (eds.) FAW 2017. LNCS, vol. 10336, pp. 1–12. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59605-1_1

    Chapter  Google Scholar 

  2. Baer, R.: Self-calibrating and/or self-testing camera module. US Patent App. 11/239,851, 30 September 2005

    Google Scholar 

  3. Bansal, S.K., et al.: Qualification of analytical instruments for use in the pharmaceutical industry: a scientific approach. Aaps Pharmscitech 5(1), 151–158 (2004)

    MathSciNet  Google Scholar 

  4. Baptiste, P.: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In: SODA, pp. 364–367. ACM Press (2006)

    Google Scholar 

  5. Baptiste, P., Chrobak, M., Dürr, C.: Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8(3), 26:1–26:29 (2012)

    Article  MathSciNet  Google Scholar 

  6. Barton-Sweeney, A., Lymberopoulos, D., Savvides, A.: Sensor localization and camera calibration in distributed camera sensor networks. In: 3rd International Conference on 2006 Broadband Communications, Networks and Systems, BROADNETS 2006, pp. 1–10. IEEE (2006)

    Google Scholar 

  7. Beamex: Traceable and efficient calibrations in the process industry, October 2007. https://www.beamex.com/wp-content/uploads/2016/12/CalibrationWorld_2007-03-ENG.pdf

  8. Bender, M.A., Bunde, D.P., Leung, V.J., McCauley, S., Phillips, C.A.: Efficient scheduling to minimize calibrations. In: SPAA, pp. 280–287. ACM (2013)

    Google Scholar 

  9. Bernhardt, R., Albright, S.: Robot Calibration. Springer, Heidelberg (1993)

    Google Scholar 

  10. Chau, V., Li, M., McCauley, S., Wang, K.: Minimizing total weighted flow time with calibrations. In: SPAA, pp. 67–76. ACM (2017)

    Google Scholar 

  11. Demaine, E.D., Ghodsi, M., Hajiaghayi, M.T., Sayedi-Roshkhar, A.S., Zadimoghaddam, M.: Scheduling to minimize gaps and power consumption. In: SPAA, pp. 46–54. ACM (2007)

    Google Scholar 

  12. Evans, R.C., Griffith, J.E., Grossman, D.D., Kutcher, M.M., Will, P.M.: Method and apparatus for calibrating a robot to compensate for inaccuracy of the robot. US Patent 4,362,977, 7 December 1982

    Google Scholar 

  13. Fineman, J.T., Sheridan, B.: Scheduling non-unit jobs to minimize calibrations. In: SPAA, pp. 161–170. ACM (2015)

    Google Scholar 

  14. Forina, M., Casolino, M.C., De la Pezuela Martínez, C.: Multivariate calibration: applications to pharmaceutical analysis. J. Pharm. Biomed. Anal. 18(1), 21–33 (1998)

    Article  Google Scholar 

  15. Nguyen, H.-N., Zhou, J., Kang, H.-J.: A new full pose measurement method for robot calibration. Sensors 13(7), 9132–9147 (2013)

    Article  Google Scholar 

  16. Wang, K.: Calibration scheduling with time slot cost. In: Tang, S., Du, D.-Z., Woodruff, D., Butenko, S. (eds.) AAIM 2018. LNCS, vol. 11343, pp. 136–148. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-04618-7_12

    Chapter  Google Scholar 

  17. Zhang, Z.: Method and system for calibrating digital cameras. US Patent 6,437,823, 20 August 2002

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yinling Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chau, V., Li, M., Wang, Y., Zhang, R., Zhao, Y. (2019). Minimizing the Cost of Batch Calibrations. In: Du, DZ., Duan, Z., Tian, C. (eds) Computing and Combinatorics. COCOON 2019. Lecture Notes in Computer Science(), vol 11653. Springer, Cham. https://doi.org/10.1007/978-3-030-26176-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26176-4_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26175-7

  • Online ISBN: 978-3-030-26176-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics