research-article

Public Access

Minimizing Total Weighted Flow Time with Calibrations

Authors:

Samuel McCauley,

Kai WangAuthors Info & Claims

SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures

Pages 67 - 76

https://doi.org/10.1145/3087556.3087573

Published: 24 July 2017 Publication History

Abstract

In sensitive applications, machines need to be periodically calibrated to ensure that they run to high standards. Creating an efficient schedule on these machines requires attention to two metrics: ensuring good throughput of the jobs, and ensuring that not too much cost is spent on machine calibration. In this paper we examine flow time as a metric for scheduling with calibrations. While previous papers guaranteed that jobs would meet a certain deadline, we relax that constraint to a tradeoff: we want to balance how long the average job waits with how many costly calibrations we need to perform.

One advantage of this metric is that it allows for online schedules (where an algorithm is unaware of a job until it arrives). Thus we give two types of results. We give an efficient offline algorithm which gives the optimal schedule on a single machine for a set of jobs which are known ahead of time. We also give online algorithms which adapt to jobs as they come. Our online algorithms are constant competitive for unweighted jobs on single or multiple machines, and constant-competitive for weighted jobs on a single machine.

References

[1]

Eric Angel, Evripidis Bampis, Vincent Chau, and Vassilis Zissimopoulos. 2017. On the Complexity of Minimizing the Total Calibration Cost. In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW '17) (LNCS), Vol. 10336. Springer, Heidelberg. To appear.

[2]

Richard Baer. 2005. Self-calibrating and/or self-testing camera module. (Sept. 30 2005). US Patent App. 11/239,851.

[3]

Surendra K Bansal, Thomas Layloff, Ernest D Bush, Marta Hamilton, Edward A Hankinson, John S Landy, Stephen Lowes, Moheb M Nasr, Paul A St Jean, and Vinod P Shah. 2004. Qualification of analytical instruments for use in the pharmaceutical industry: A scientific approach. Aaps Pharmscitech 5, 1 (2004), 151--158.

[4]

Philippe Baptiste. 2006. Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. In Proceedings of the 17th. ACM-SIAM Symposium on Discrete Algorithms (SODA '06). SIAM, Philadelphia, 364--367.

[5]

HP Barringer. 1995. Cost Effective Calibration Intervals Using Weibull Analysis. In Proceedings of the 11th. Quality Congress. American Society For Quality Control, Milwaukee, 1026--1038.

[6]

Andrew Barton-Sweeney, Dimitrios Lymberopoulos, and Andreas Savvides. 2006. Sensor localization and camera calibration in distributed camera sensor networks. In Proceedings of the 3rd. International Conference on Broadband Communications, Networks and Systems (BROADNETS '06). IEEE, Piscataway, 1--10.

[7]

Beamex. 2007. 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]

Michael A. Bender, David P. Bunde, Vitus J. Leung, Samuel McCauley, and Cynthia A. Phillips. 2013. Efficient Scheduling to Minimize Calibrations. In Proceedings of the 25th. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '13). ACM Press, New York, NY, 280--287.

Digital Library

[9]

Rolf Bernhardt and S Albright. 1993. Robot calibration. Springer Science & Business Media, Heidelberg.

[10]

Allan Borodin and Ran El-Yaniv. 2005. Online computation and competitive analysis. Cambridge University Press, Cambridge.

[11]

Niv Buchbinder and Joseph Naor. 2009. The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science 3, 2--3 (2009), 93--263.

Digital Library

[12]

Chris Burroughs. 2006. New Integrated Stockpile Evaluation program to better ensure weapons stockpile Safety, Security, Reliability. http://www.sandia.gov/LabNews/060331.html. (March 2006). Online; posted March 2006.

[13]

Roger C Evans, John E Griffith, David D Grossman, Myron M Kutcher, and Peter M Will. 1982. Method and Apparatus for Calibrating a Robot to Compensate for Inaccuracy of the Robot. (Dec. 7 1982). US Patent 4,362,977.

[14]

Jeremy T Fineman and Brendan Sheridan. 2015. Scheduling Non-Unit Jobs to Minimize Calibrations. In Proceedings of the 27th. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '15). ACM Press, New York, NY, 161--170.

Digital Library

[15]

M Forina, MC Casolino, and C De la Pezuela Martınez. 1998. Multivariate calibration: applications to pharmaceutical analysis. Journal of pharmaceutical and biomedical analysis 18, 1 (1998), 21--33.

[16]

Michel X Goemans and David P Williamson. 1997. The primal-dual method for approximation algorithms and its application to network design problems. PWS Publishing Co, Boston. 144--191 pages.

[17]

James R. Lakin. 2014. Establishing Calibration Intervals, How Often Should One Calibrate? http://www.inspec-inc.com/home/company/blog/inspec-insights/2014/09/30/establishing-calibration-intervals-how-often-should-one-calibrate. (Sep 2014). Online; posted 30 September 2014.

[18]

Kuo-Huang Lin and Bin-Da Liu. 2005. A gray system modeling approach to the prediction of calibration intervals. IEEE Transactions on Instrumentation and Measurement 54, 1 (2005), 297--304.

[19]

Alexander Macker, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. 2016. Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the 10th. International Conference on Combinatorial Optimization and Applications (COCOA '16). Springer, Heidelberg, 578--592.

[20]

National Nuclear Safety Administration. 2014. Office of Test and Evaluation. http://nnsa.energy.gov/aboutus/ourprograms/defenseprograms/stockpilestewardship/testcapabilitiesand-eval. (September 2014). Online; posted 30 September 2014.

[21]

Hoai-Nhan Nguyen, Jian Zhou, and Hee-Jun Kang. 2013. A new full pose measurement method for robot calibration. Sensors 13, 7 (2013), 9132--9147.

[22]

Emilia Nunzi, Gianna Panfilo, Patrizia Tavella, Paolo Carbone, and Dario Petri. 2005. Stochastic and reactive methods for the determination of optimal calibration intervals. IEEE Transactions on Instrumentation and Measurement 54, 4 (2005), 1565--1569.

[23]

SR Postlethwaite, DG Ford, and D Morton. 1997. Dynamic calibration of CNC machine tools. International Journal of Machine Tools and Manufacture 37, 3 (1997), 287--294.

[24]

Daniel D Sleator and Robert E Tarjan. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (1985), 202--208.

Digital Library

[25]

Tobias Wilken, C Lovis, A Manescau, Tilo Steinmetz, L Pasquini, G Lo Curto, Theodor W Hansch, Ronald Holzwarth, and Th Udem. 2010. High-precision calibration of spectrographs. Monthly Notices of the Royal Astronomical Society: Letters 405, 1 (2010), L16--L20.

[26]

Donald W. Wyatt and Howard T. Castrup. 1991. Managing Calibration Intervals. (1991).

[27]

G Zhang and R Hocken. 1986. Improving the accuracy of angle measurement in machine calibration. CIRP Annals-Manufacturing Technology 35, 1 (1986), 369--372.

[28]

Zhengyou Zhang. 2000. A flexible new technique for camera calibration. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 11 (2000), 1330--1334.

Digital Library

[29]

Zhengyou Zhang. 2002. Method and system for calibrating digital cameras. (Aug. 20 2002). US Patent 6,437,823.

Cited By

Chen ZZhang J(2022)Online scheduling of time-critical tasks to minimize the number of calibrationsTheoretical Computer Science10.1016/j.tcs.2022.01.040Online publication date: Jan-2022
https://doi.org/10.1016/j.tcs.2022.01.040
Chen HChen LZhang GChau V(2021)Scheduling with Variable-length Calibrations: Two Agreeable VariantsTheoretical Computer Science10.1016/j.tcs.2021.07.021Online publication date: Jul-2021
https://doi.org/10.1016/j.tcs.2021.07.021
Angel EBampis EChau VZissimopoulos V(2021)Calibrations scheduling with arbitrary lengths and activation lengthJournal of Scheduling10.1007/s10951-021-00688-5Online publication date: 2-Jun-2021
https://doi.org/10.1007/s10951-021-00688-5
Show More Cited By

Index Terms

Minimizing Total Weighted Flow Time with Calibrations
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Scheduling Non-Unit Jobs to Minimize Calibrations
SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures

The recently proposed Integrated Stockpile Evaluation (ISE) problem extends a classic offline scheduling problem where n jobs, each with arrival times and deadlines, must be scheduled nonpreemptively on m machines. The additional constraint in the ISE ...
Minimizing mean flow time for UET tasks

We consider the problem of scheduling a set of n unit-execution-time (UET) tasks, with precedence constraints, on m ≥ 1 parallel and identical processors so as to minimize the mean flow time. For two processors, the Coffman--Graham algorithm gives a ...
Approximation algorithms for minimizing the total weighted tardiness on a single machine

Given a single machine and a set of jobs with due dates, the classical NP-hard problem of scheduling to minimize total tardiness is a well-understood one. Lawler gave a fully polynomial-time approximation scheme (FPTAS) for it some 20 years ago. If the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures

July 2017

392 pages

ISBN:9781450345934

DOI:10.1145/3087556

General Chair:
Christian Scheideler
Paderborn University, Germany
,
Program Chair:
Mohammad Hajiaghayi
University of Maryland at College Park, USA

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
EATCS: European Association for Theoretical Computer Science

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 July 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Shenzhen basic research grant
NSFC
Sandia National Laboratories
Research Grants Council of the Hong Kong Special Administrative Region China
NSF

Conference

SPAA '17

Sponsor:

SPAA '17: 29th ACM Symposium on Parallelism in Algorithms and Architectures

July 24 - 26, 2017

DC, Washington, USA

Acceptance Rates

SPAA '17 Paper Acceptance Rate 31 of 127 submissions, 24%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
314
Total Downloads

Downloads (Last 12 months)46
Downloads (Last 6 weeks)13

Reflects downloads up to 17 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen ZZhang J(2022)Online scheduling of time-critical tasks to minimize the number of calibrationsTheoretical Computer Science10.1016/j.tcs.2022.01.040Online publication date: Jan-2022
https://doi.org/10.1016/j.tcs.2022.01.040
Chen HChen LZhang GChau V(2021)Scheduling with Variable-length Calibrations: Two Agreeable VariantsTheoretical Computer Science10.1016/j.tcs.2021.07.021Online publication date: Jul-2021
https://doi.org/10.1016/j.tcs.2021.07.021
Angel EBampis EChau VZissimopoulos V(2021)Calibrations scheduling with arbitrary lengths and activation lengthJournal of Scheduling10.1007/s10951-021-00688-5Online publication date: 2-Jun-2021
https://doi.org/10.1007/s10951-021-00688-5
Chau VLi MWang EZhang RZhao Y(2020)Minimizing the cost of batch calibrationsTheoretical Computer Science10.1016/j.tcs.2020.04.020Online publication date: May-2020
https://doi.org/10.1016/j.tcs.2020.04.020
Wang K(2020)Calibration Scheduling with Time Slot CostTheoretical Computer Science10.1016/j.tcs.2020.03.018Online publication date: Mar-2020
https://doi.org/10.1016/j.tcs.2020.03.018
Chen HChau VChen LZhang G(2020)Scheduling Many Types of CalibrationsAlgorithmic Aspects in Information and Management10.1007/978-3-030-57602-8_26(286-297)Online publication date: 9-Aug-2020
https://doi.org/10.1007/978-3-030-57602-8_26
Chen LLi MLin GWang KScheideler CBerenbrink P(2019)Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement)The 31st ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3323165.3323173(237-239)Online publication date: 17-Jun-2019
https://dl.acm.org/doi/10.1145/3323165.3323173
Chau VLi MWang YZhang RZhao Y(2019)Minimizing the Cost of Batch CalibrationsComputing and Combinatorics10.1007/978-3-030-26176-4_7(78-89)Online publication date: 21-Jul-2019
https://doi.org/10.1007/978-3-030-26176-4_7
Chau VFeng SLi MWang YZhang GZhang Y(2019)Weighted Throughput Maximization with CalibrationsAlgorithms and Data Structures10.1007/978-3-030-24766-9_23(311-324)Online publication date: 12-Jul-2019
https://doi.org/10.1007/978-3-030-24766-9_23
Wang K(2018)Calibration Scheduling with Time Slot CostAlgorithmic Aspects in Information and Management10.1007/978-3-030-04618-7_12(136-148)Online publication date: 17-Nov-2018
https://doi.org/10.1007/978-3-030-04618-7_12

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten