Skip to main content
SpringerLink
Log in

Calibration Scheduling with Time Slot Cost

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2018)

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

Included in the following conference series:

Abstract

In this paper we study the scheduling problem with calibration and time slot cost. In this model, the machine has to be calibrated to run a job and the calibration remains valid for a fixed time period of length T, after which it must be recalibrated before running more jobs. On the other hand, a certain cost will be incurred when the machine executes a job and the cost is determined by the time slots occupied by the job in the schedule. We work on the jobs with release times, deadlines and identical processing times. The objective is to schedule the jobs on a single machine and minimize the total cost while calibrating the machine at most K times. We propose dynamic programmings for different scenarios of this problem, as well as a greedy algorithm for the non-calibration version of this problem.

K. Wang—We thank Prof. Minming Li and Mr. Yanbin Gong for their helpful discussions. The work described in this paper was supported by a grant from Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 11268616).

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 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

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. Bender, M.A., Bunde, D.P., Leung, V.J., McCauley, S., Phillips, C.A.: Efficient scheduling to minimize calibrations. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, pp. 280–287. ACM, New York (2013)

    Google Scholar 

  3. Bringmann, B., Küng, A., Knapp, W.: A measuring artefact for true 3D machine testing and calibration. CIRP Ann.-Manuf. Technol. 54(1), 471–474 (2005)

    Article  Google Scholar 

  4. Burroughs, C.: New integrated stockpile evaluation program to better ensure weapons stockpile safety, security, reliability (2006)

    Google Scholar 

  5. Chau, V., Li, M., McCauley, S., Wang, K.: Minimizing total weighted flow time with calibrations. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, pp. 67–76. ACM, New York (2017)

    Google Scholar 

  6. Chen, L., Megow, N., Rischke, R., Stougie, L., Verschae, J.: Optimal algorithms and a PTAS for cost-aware scheduling. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 211–222. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48054-0_18

    Chapter  Google Scholar 

  7. Fineman, J.T., Sheridan, B.: Scheduling non-unit jobs to minimize calibrations. In: Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, pp. 161–170. ACM, New York (2015)

    Google Scholar 

  8. Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)

    Article  MathSciNet  Google Scholar 

  9. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617–643 (2000)

    Article  MathSciNet  Google Scholar 

  10. 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 

  11. Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)

    MATH  Google Scholar 

  12. Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the 29th ACM Symposium on Theory of Computing, STOC 1997, pp. 140–149. ACM Press, New York (1997)

    Google Scholar 

  13. Wan, G., Qi, X.: Scheduling with variable time slot costs. Naval Res. Log. (NRL) 57(2), 159–171 (2010)

    MathSciNet  MATH  Google Scholar 

  14. Zhang, Z.: A flexible new technique for camera calibration. IEEE Trans. Pattern Anal. Mach. Intell. 22(11), 1330–1334 (2000)

    Article  Google Scholar 

  15. Zhao, Y., Qi, X., Li, M.: On scheduling with non-increasing time slot cost to minimize total weighted completion time. J. Sched. 19(6), 759–767 (2016)

    Article  MathSciNet  Google Scholar 

  16. Zhong, W., Liu, X.: A single machine scheduling problem with time slot costs. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds.) Recent Advances in Computer Science and Information Engineering. LNEE, vol. 126, pp. 677–681. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-25766-7_90

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong SAR, China

    Kai Wang

Authors
  1. Kai Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kai Wang .

Editor information

Editors and Affiliations

  1. The University of Texas at Dallas, Richardson, TX, USA

    Shaojie Tang

  2. University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

  3. University of California, Davis, Davis, CA, USA

    David Woodruff

  4. Texas A&M University, College Station, TX, USA

    Sergiy Butenko

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, K. (2018). Calibration Scheduling with Time Slot Cost. In: Tang, S., Du, DZ., Woodruff, D., Butenko, S. (eds) Algorithmic Aspects in Information and Management. AAIM 2018. Lecture Notes in Computer Science(), vol 11343. Springer, Cham. https://doi.org/10.1007/978-3-030-04618-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04618-7_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04617-0

  • Online ISBN: 978-3-030-04618-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation