No article text was recorded for this version.
multi-machine scheduling complexity
Version 1 of 122 papers24 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Improved Online Algorithm for Weighted Flow Time
- Blog: Scheduling to Approximate Minimization Objectives on Identical Machines
- Blog: Distributed order scheduling and its application to multi-core dram controllers
- Blog: An Exploration of Multitasking Scheduling Considering Interruptible Job Assignments, Machine Aging Effects, the Influence of Deteriorating Maintenance, and Symmetry
- Blog: Optimal Non-preemptive Semi-online Scheduling on Two Related Machines
- Blog: A note on scheduling to meet two min-sum objectives
- Blog: Mixed integer formulations using natural variables for single machine scheduling around a common due date
- Blog: Scheduling with non-renewable resources: minimizing the sum of completion times
- Blog: Scheduling a Proportionate Flow Shop of Batching Machines
- Blog: Meta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date
- Blog: A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines
- Blog: Single Machine Slack Due-Window Assignment and Scheduling of Linear Time-Dependent Deteriorating Jobs and a Deteriorating Maintenance Activity
- Blog: A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
- Blog: Admissible Search Methods for
- Blog: Online Scheduling on Identical Machines using SRPT
- Blog: On-line scheduling to minimize average completion time revisited
- Blog: Distortion-Oblivious Algorithms for Scheduling on Multiple Machines
- Blog: Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Blog: Universal Sequencing on an Unreliable Machine
- Blog: Energy-Efficient Scheduling Problem Using an Effective Hybrid Multi-Objective Evolutionary Algorithm
- Blog: Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model
- Blog: A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_multi_machine_scheduling_complexity_af1528ca,
title = {multi-machine scheduling complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/multi-machine-scheduling-complexity/rdr_af1528ca651a4ea788e4e949f0b81ac3},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_multi_machine_scheduling_complexity_af1528ca_v1,
title = {multi-machine scheduling complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/multi-machine-scheduling-complexity/rdr_af1528ca651a4ea788e4e949f0b81ac3/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}