Scheduling with Calibrations for Multi-Interval Jobs

References

• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows—Theory, Algorithms and Applications (Prentice Hall, Lebanon, IN).Google Scholar
• Angel E, Bampis E, Chau V, Zissimopoulos V (2021) Calibrations scheduling with arbitrary lengths and activation length. J. Scheduling 24(5):459–467.Crossref, Google Scholar
• Bansal SK, Layloff T, Bush ED, Hamilton M, Hankinson EA, Landy JS, Lowes S, Nasr MM, St Jean PA, Shah VP (2004) Qualification of analytical instruments for use in the pharmaceutical industry: A scientific approach. AAPS PharmSciTech 5(1):E22.Google Scholar
• Bender MA, Bunde DP, Leung VJ, McCauley S, Phillips CA (2013) Efficient scheduling to minimize calibrations. Blelloch GE, Vöcking B, eds. 25th ACM Sympos. Parallelism Algorithms Architectures SPAA ‘13 (ACM, New York), 280–287.Google Scholar
• Bringmann B, Küng A, Knapp W (2005) A measuring artefact for true 3D machine testing and calibration. CIRP Ann. 54(1):471–474.Crossref, Google Scholar
• Chang J, Gabow HN, Khuller S (2012) A model for minimizing active processor time. Epstein L, Ferragina P, eds. Algorithms ESA 2012 20th Annual Eur. Sympos. Proc., Lecture Notes in Computer Science, vol. 7501 (Springer, New York), 289–300.Google Scholar
• Chau V, Li M, McCauley S, Wang K (2017) Minimizing total weighted flow time with calibrations. Scheideler C, Hajiaghayi MT, eds. Proc. 29th ACM Sympos. Parallelism Algorithms Architectures SPAA 2017 (ACM, New York), 67–76.Google Scholar
• Chau V, Li M, Wang Y, Zhang R, Zhao Y (2020) Minimizing the cost of batch calibrations. Theoret. Comput. Sci. 828–829:55–64.Crossref, Google Scholar
• Chau V, Feng S, Li M, Wang Y, Zhang G, Zhang Y (2019) Weighted throughput maximization with calibrations. Friggstad Z, Sack JR, Salavatipour MR, eds. Algorithms Data Structures 16th Internat. Sympos. WADS 2019 Proc., Lecture Notes in Computer Science, vol. 11646 (Springer, New York), 311–324.Google Scholar
• Chen H, Chen L, Zhang G, Chau V (2021) Scheduling with variable-length calibrations: Two agreeable variants. Theoret. Comput. Sci. 886:94–105.Crossref, Google Scholar
• Chen L, Li M, Lin G, Wang K (2019) Approximation of scheduling with calibrations on multiple machines (brief announcement). Scheideler C, Berenbrink P, eds. 31st ACM Sympos. Parallelism Algorithms Architectures SPAA 2019 (ACM, New York), 237–239.Google Scholar
• Chuzhoy J, Naor J (2006) Covering problems with hard capacities. SIAM J. Comput. 36(2):498–515.Crossref, Google Scholar
• Demaine ED, Ghodsi M, Hajiaghayi MT, Sayedi-Roshkhar AS, Zadimoghaddam M (2007) Scheduling to minimize gaps and power consumption. Gibbons PB, Scheideler C, eds. SPAA 2007 Proc. 19th Annual ACM Sympos. Parallelism Algorithms Architectures (ACM, New York), 46–54.Google Scholar
• Feng Q, Jiang X, Wang J (2016) Improved algorithms for several parameterized problems based on random methods. Zhu D, Bereg S, eds. Frontiers Algorithmics 10th Internat. Workshop FAW 2016 Proc., Lecture Notes in Computer Science, vol. 9711 (Springer, New York), 65–74.Google Scholar
• Fineman JT, Sheridan B (2015) Scheduling non-unit jobs to minimize calibrations. Blelloch GE, Agrawal K, eds. Proc. 27th ACM Sympos. Parallelism Algorithms Architectures SPAA 2015 (ACM, New York), 161–170.Google Scholar
• Goeva A, Lam H, Qian H, Zhang B (2019) Optimization-based calibration of simulation input models. Oper. Res. 67(5):1362–1382.Link, Google Scholar
• Gotoh J, Kim MJ, Lim AEB (2021) Calibration of distributionally robust empirical optimization models. Oper. Res. 69(5):1630–1650.Link, Google Scholar
• Li T, Dahleh MA (2024) Automation of strategic data prioritization in system model calibration: Sensor placement. INFORMS J. Comput. 36(1):163–184.Link, Google Scholar
• Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions—I. Math. Programming 14(1):265–294.Crossref, Google Scholar
• Nguyen H-N, Zhou J, Kang H-J (2013) A new full pose measurement method for robot calibration. Sensors 13(7):9132–9147.Crossref, Google Scholar
• Simons B, Sipser M (1984) On scheduling unit-length jobs with multiple release time/deadline intervals. Oper. Res. 32(1):80–88.Link, Google Scholar
• Tian W, Li M, Chen E (2010) Energy optimal schedules for jobs with multiple active intervals. Theoret. Comput. Sci. 411(3):672–676.Crossref, Google Scholar
• Trevisan L (2001) Non-approximability results for optimization problems on bounded degree instances. Scott Vitter J, Spirakis PG, Yannakakis M, eds. Proc. 33rd Annual ACM Sympos. Theory Comput. (ACM, New York), 453–461.Google Scholar
• Wang K (2020) Calibration scheduling with time slot cost. Theoret. Comput. Sci. 821:1–14.Crossref, Google Scholar
• WebLink (2016) Maximum weight matching and submodular functions. Accessed July 19, 2016, https://cstheory.stackexchange.com/a/36209/34178.Google Scholar
• Wolsey LA (1982) An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4):385–393.Crossref, Google Scholar
• Zhang Z (2000) A flexible new technique for camera calibration. IEEE Trans. Pattern Anal. Machine Intelligence 22(11):1330–1334.Crossref, Google Scholar