Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Total Completion Time Scheduling Under Scenarios (2402.19259v1)

Published 29 Feb 2024 in cs.DS

Abstract: Scheduling jobs with given processing times on identical parallel machines so as to minimize their total completion time is one of the most basic scheduling problems. We study interesting generalizations of this classical problem involving scenarios. In our model, a scenario is defined as a subset of a predefined and fully specified set of jobs. The aim is to find an assignment of the whole set of jobs to identical parallel machines such that the schedule, obtained for the given scenarios by simply skipping the jobs not in the scenario, optimizes a function of the total completion times over all scenarios. While the underlying scheduling problem without scenarios can be solved efficiently by a simple greedy procedure (SPT rule), scenarios, in general, make the problem NP-hard. We paint an almost complete picture of the evolving complexity landscape, drawing the line between easy and hard. One of our main algorithmic contributions relies on a deep structural result on the maximum imbalance of an optimal schedule, based on a subtle connection to Hilbert bases of a related convex cone.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (29)
  1. When the optimum is also blind: a new perspective on universal optimization. In 44th International Colloquium on Automata, Languages and Programming,ICALP, volume 80 of LIPIcs, pages 35:1–35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
  2. Online makespan minimization with budgeted uncertainty. In Anna Lubiw and Mohammad R. Salavatipour, editors, Algorithms and Data Structures - 17th Int. Symposium, WADS 2021, volume 12808 of Lecture Notes in Computer Science, pages 43–56. Springer, 2021.
  3. Complexity of single machine scheduling problems under scenario-based uncertainty. Oper. Res. Lett., 36(3):338–342, 2008.
  4. Multicriteria global minimum cuts. Algorithmica, 46(1):15–26, 2006.
  5. (2+ϵ2italic-ϵ2+\epsilon2 + italic_ϵ)-SAT is NP-hard. In Proceedings of 55th Annual Symposium on Foundations of Computer Science, pages 1–10. IEEE, 2014.
  6. Robust Optimization, volume 28 of Princeton Series in Applied Mathematics. Princeton University Press, 2009.
  7. A priori optimization. Operations Research, 38(6):1019–1033, 1990.
  8. Introduction to stochastic programming. Springer Science & Business Media, 2011.
  9. Approximation results for makespan minimization with budgeted uncertainty. Theory Comput. Syst., 65(6):903–915, 2021.
  10. SPT optimality (mostly) via linear programming. Oper. Res. Lett., 51(1):99–104, 2023.
  11. Theory of Scheduling. Addison-Wesley Publishing Company, 1967.
  12. Bounds for the optimal scheduling of n𝑛nitalic_n jobs on m𝑚mitalic_m processors. Management Science, 11(2):268–279, 1964.
  13. Minimizing worst-case and average-case makespan over scenarios. Journal of Scheduling, pages 1–11, 2016.
  14. Two-dimensional gantt charts and a scheduling algorithm of Lawler. SIAM J. Discret. Math., 13(3):281–294, 2000.
  15. Johan Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798–859, 2001.
  16. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 691–700. Society for Industrial and Applied Mathematics, 2004.
  17. Parallel machine scheduling under uncertainty. In Advances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, pages 74–83. Springer, 2012.
  18. Single machine scheduling problems with uncertain parameters and the OWA criterion. Journal of Scheduling, 19:177–190, 2016.
  19. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM Journal on Computing, 37(1):319–357, 2007.
  20. The sample average approximation method for stochastic discrete optimization. SIAM Journal on Optimization, 12(2):479–502, 2002.
  21. Robust discrete optimization and its applications. Kluwer Academic Publishers, 1997.
  22. Single machine scheduling with scenarios. Theoretical Computer Science, 477:57–66, 2013.
  23. Dual techniques for scheduling on a machine with varying speed. SIAM Journal on Discrete Mathematics, 32(3):1541–1571, 2018.
  24. Alexander Schrijver. Theory of Linear and Integer programming. Wiley-Interscience, 1986.
  25. Scheduling unrelated machines by randomized rounding. SIAM J. Discret. Math., 15(4):450–469, 2002.
  26. A state-of-the-art survey on multi-scenario scheduling. European Journal of Operational Research, 2022.
  27. M. Skutella. Approximation and Randomization in Scheduling. PhD thesis, Technische Universität Berlin, 1998.
  28. A priori tsp in the scenario model. Discrete Applied Mathematics, 250:331–341, 2018.
  29. On the robust single machine scheduling problem. Journal of Combinatorial Optimization, 6(1):17–33, 2002.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now