{"url":"/task/scheduling","name":"Scheduling","slug":"scheduling","description_markdown":"Project or Job Scheduling","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":3104,"papers_with_code":574,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/llmafia","name":"LLMafia","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":574,"tagged_in_all":3104,"items":[{"url":"/paper/endonet-a-deep-architecture-for-recognition","title":"EndoNet: A Deep Architecture for Recognition Tasks on Laparoscopic Videos","date":"2016-02-09","arxiv_id":"1602.03012","repositories_listed":9,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/stochastic-gradient-descent-with-hyperbolic","title":"Stochastic Gradient Descent with Hyperbolic-Tangent Decay on Classification","date":"2018-06-05","arxiv_id":"1806.01593","repositories_listed":5,"syntology":null},{"url":"/paper/openrlhf-an-easy-to-use-scalable-and-high","title":"OpenRLHF: An Easy-to-use, Scalable and High-performance RLHF Framework","date":"2024-05-20","arxiv_id":"2405.11143","repositories_listed":4,"syntology":null},{"url":"/paper/a-reinforcement-learning-environment-for-job","title":"A Reinforcement Learning Environment For Job-Shop Scheduling","date":"2021-04-08","arxiv_id":"2104.03760","repositories_listed":4,"syntology":null},{"url":"/paper/learning-to-dispatch-for-job-shop-scheduling","title":"Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning","date":"2020-10-23","arxiv_id":"2010.12367","repositories_listed":4,"syntology":{"n":3,"n_ran":0,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/das3h-modeling-student-learning-and","title":"DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills","date":"2019-05-14","arxiv_id":"1905.06873","repositories_listed":4,"syntology":{"n":22,"n_ran":5,"n_unverified":17,"n_pointer_only":9}},{"url":"/paper/eccos-efficient-capability-and-cost","title":"OmniRouter: Budget and Performance Controllable Multi-LLM Routing","date":"2025-02-27","arxiv_id":"2502.20576","repositories_listed":3,"syntology":null},{"url":"/paper/chat-ai-a-seamless-slurm-native-solution-for","title":"Chat AI: A Seamless Slurm-Native Solution for HPC-Based Services","date":"2024-06-27","arxiv_id":"2407.00110","repositories_listed":3,"syntology":null},{"url":"/paper/mlink-linking-black-box-models-from-multiple","title":"MLink: Linking Black-Box Models from Multiple Domains for Collaborative Inference","date":"2022-09-28","arxiv_id":"2209.13883","repositories_listed":3,"syntology":null},{"url":"/paper/bftrainer-low-cost-training-of-neural","title":"BFTrainer: Low-Cost Training of Neural Networks on Unfillable Supercomputer Nodes","date":"2021-06-22","arxiv_id":"2106.12091","repositories_listed":3,"syntology":null},{"url":"/paper/cpp-taskflow-a-general-purpose-parallel-and","title":"Taskflow: A Lightweight Parallel and Heterogeneous Task Graph Computing System","date":"2020-04-23","arxiv_id":"2004.10908","repositories_listed":3,"syntology":null},{"url":"/paper/tiramisu-a-polyhedral-compiler-for-expressing","title":"Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code","date":"2018-04-27","arxiv_id":"1804.10694","repositories_listed":3,"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/key-value-retrieval-networks-for-task","title":"Key-Value Retrieval Networks for Task-Oriented Dialogue","date":"2017-05-15","arxiv_id":"1705.05414","repositories_listed":3,"syntology":null},{"url":"/paper/reinforcement-learning-through-asynchronous","title":"Reinforcement Learning through Asynchronous Advantage Actor-Critic on a GPU","date":"2016-11-18","arxiv_id":"1611.06256","repositories_listed":3,"syntology":null},{"url":"/paper/flashdmoe-fast-distributed-moe-in-a-single","title":"FlashDMoE: Fast Distributed MoE in a Single Kernel","date":"2025-06-05","arxiv_id":"2506.04667","repositories_listed":2,"syntology":{"n":7,"n_ran":2,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/unveiling-redundancy-in-diffusion","title":"Unveiling Redundancy in Diffusion Transformers (DiTs): A Systematic Study","date":"2024-11-18","arxiv_id":"2411.13588","repositories_listed":2,"syntology":{"n":8,"n_ran":0,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/one-step-diffusion-via-shortcut-models","title":"One Step Diffusion via Shortcut Models","date":"2024-10-16","arxiv_id":"2410.12557","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/agent-oriented-planning-in-multi-agent","title":"Agent-Oriented Planning in Multi-Agent Systems","date":"2024-10-03","arxiv_id":"2410.02189","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":3}},{"url":"/paper/planning-in-strawberry-fields-evaluating-and","title":"Planning in Strawberry Fields: Evaluating and Improving the Planning and Scheduling Capabilities of LRM o1","date":"2024-10-03","arxiv_id":"2410.02162","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/parco-learning-parallel-autoregressive","title":"Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","date":"2024-09-05","arxiv_id":"2409.03811","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/marlin-mixed-precision-auto-regressive","title":"MARLIN: Mixed-Precision Auto-Regressive Parallel Inference on Large Language Models","date":"2024-08-21","arxiv_id":"2408.11743","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/rationalising-data-collection-for-building","title":"Rationalising data collection for supporting decision making in building energy systems using Value of Information analysis","date":"2024-08-19","arxiv_id":"2409.00049","repositories_listed":2,"syntology":null},{"url":"/paper/the-road-less-scheduled","title":"The Road Less Scheduled","date":"2024-05-24","arxiv_id":"2405.15682","repositories_listed":2,"syntology":null},{"url":"/paper/flagvne-a-flexible-and-generalizable","title":"FlagVNE: A Flexible and Generalizable Reinforcement Learning Framework for Network Resource Allocation","date":"2024-04-19","arxiv_id":"2404.12633","repositories_listed":2,"syntology":{"n":6,"n_ran":1,"n_unverified":5,"n_pointer_only":6}},{"url":"/paper/llm-agent-operating-system","title":"AIOS: LLM Agent Operating System","date":"2024-03-25","arxiv_id":"2403.16971","repositories_listed":2,"syntology":null},{"url":"/paper/fairness-in-serving-large-language-models","title":"Fairness in Serving Large Language Models","date":"2023-12-31","arxiv_id":"2401.00588","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/aspen-high-throughput-lora-fine-tuning-of","title":"mLoRA: Fine-Tuning LoRA Adapters via Highly-Efficient Pipeline Parallelism in Multiple GPUs","date":"2023-12-05","arxiv_id":"2312.02515","repositories_listed":2,"syntology":null},{"url":"/paper/opuscleaner-and-opustrainer-open-source","title":"OpusCleaner and OpusTrainer, open source toolkits for training Machine Translation and Large language models","date":"2023-11-24","arxiv_id":"2311.14838","repositories_listed":2,"syntology":null},{"url":"/paper/dynapipe-optimizing-multi-task-training","title":"DynaPipe: Optimizing Multi-task Training through Dynamic Pipelines","date":"2023-11-17","arxiv_id":"2311.10418","repositories_listed":2,"syntology":null},{"url":"/paper/game-based-platforms-for-artificial","title":"Games for Artificial Intelligence Research: A Review and Perspectives","date":"2023-04-26","arxiv_id":"2304.13269","repositories_listed":2,"syntology":null}],"syntology_records":13,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}