Bounds on Multiprocessing Timing Anomalies
From MaRDI portal
Publication:5582060
DOI10.1137/0117039zbMath0188.23101OpenAlexW2104680817WikidataQ29012258 ScholiaQ29012258MaRDI QIDQ5582060
Publication date: 1969
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c037edd22215b89c8d2924d4e3c81eb84fdadec7
Related Items
Vertex cover meets scheduling, Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions, A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem, A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines, A characterization of optimal multiprocessor schedules and new dominance rules, Scheduling with testing on multiple identical parallel machines, A 13/12 approximation algorithm for bin packing with extendable bins, Semi on-line scheduling on three processors with known sum of the tasks, The impact of local policies on the quality of packet routing in paths, trees, and rings, On-line scheduling with setup costs, Fast approximation algorithms for bi-criteria scheduling with machine assignment costs, The structure and complexity of Nash equilibria for a selfish routing game, A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks, A new algorithm for online uniform-machine scheduling to minimize the makespan, Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming, Scheduling under linear constraints, On-line scheduling on parallel machines to minimize the makespan, Linear time algorithms for parallel machine scheduling, A taxonomy of flexible flow line scheduling procedures, Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime, Truthful algorithms for scheduling selfish tasks on parallel machines, Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules, Performance ratios of the Karmarkar-Karp differencing method, State aggregation in dynamic programming - an application to scheduling of independent jobs on parallel processors, Decentralized list scheduling, Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines, An engineering process for the verification of real-time systems, Machine scheduling with resource dependent processing times, Scheduling web advertisements: a note on the minspace problem, Scheduling parallel machines for the customer order problem, Scheduling parallel jobs to minimize the makespan, Heuristics for parallel machine scheduling with batch delivery consideration, Semi-online scheduling for jobs with release times, Heuristic stability: a permutation disarray measure, Maximizing the minimum load: the cost of selfishness, Reducing price of anarchy of selfish task allocation with more selfishness, Improved semi-online makespan scheduling with a reordering buffer, Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence, Multi-criteria scheduling: an agent-based approach for expert knowledge integration, On multiprocessor temperature-aware scheduling problems, A cutting and scheduling problem in float glass manufacturing, Improved upper bounds for online malleable job scheduling, Partial solutions and multifit algorithm for multiprocessor scheduling, Coordination mechanisms with hybrid local policies, Scheduling and fixed-parameter tractability, Minimizing expectation plus variance, Scheduling on same-speed processors with at most one downtime on each machine, An efficient algorithm for semi-online multiprocessor scheduling with given total processing time, An effective approximation algorithm for the malleable parallel task scheduling problem, Computer-assisted proof of performance ratios for the differencing method, On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints, A note on Graham's bound, Multi-task implementation of multi-periodic synchronous programs, Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines, Scheduling of uniform parallel machines with s-precedence constraints, Non-clairvoyant scheduling games, A novel robust on-line protocol for load-balancing in structured peer-to-peer systems, A state-of-the-art review of parallel-machine scheduling research, Selfish bin covering, Parallel machine covering with limited number of preemptions, Minimizing the makespan in nonpreemptive parallel machine scheduling problem, Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information, Online square packing with gravity, Robust reachability in timed automata and games: a game-based approach, Single-processor scheduling with time restrictions, Improved approximation algorithms for scheduling parallel jobs on identical clusters, Online bin stretching with bunch techniques, Unrelated parallel machine scheduling -- perspectives and progress, Notes on a hierarchical scheduling problem on identical machines, A coordination mechanism for a scheduling game with parallel-batching machines, Bee colony optimization for scheduling independent tasks to identical processors, Performance bounds on multiprocessor scheduling strategies for statically allocated programs, Combination of parallel machine scheduling and vertex cover, Scheduling with bully selfish jobs, Semi-online preemptive scheduling: one algorithm for all variants, On robust online scheduling algorithms, A composite algorithm for multiprocessor scheduling, Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay., Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems, Semi-on-line multiprocessor scheduling with given total processing time, Online scheduling with a buffer on related machines, Scheduling algorithms for flexible flowshops: Worst and average case performance, Performance of the LPT algorithm in multiprocessor scheduling, Efficient priority rules for the stochastic resource-constrained project scheduling problem, Isomorphic scheduling problems, Makespan minimization for parallel machines scheduling with multiple availability constraints, Parallel bundle-based decomposition for large-scale structured mathematical programming problems, Approximation algorithms for scheduling unrelated parallel machines, Distribution-free bounds on the expectation of the maximum with scheduling applications, Parallel machines scheduling with nonsimultaneous machine available time, List scheduling of parallel tasks, Online scheduling on three uniform machines, Scheduling MapReduce jobs on identical and unrelated processors, Research on construction and application for the model of multistage job shop scheduling problem, Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm, Mathematical programming formulations for machine scheduling: A survey, On the complexity of scheduling unit-time jobs with or-precedence constraints, The no-wait flow-shop paradox, No-wait flexible flowshop scheduling with no-idle machines, An analysis of the LPT algorithm for the max-min and the min-ratio partition problems, A note on minimizing the sum of squares of machine completion times on two identical parallel machines, The shortest first coordination mechanism for a scheduling game with parallel-batching machines, \(\kappa\)-partitioning problems for maximizing the minimum load, Parallel machine scheduling under a grade of service provision, Faster minimization of tardy processing time on a single machine, A modified LPT algorithm for the two uniform parallel machine makespan minimization problem, New approximation bounds for LPT scheduling, Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion, The maximum gain of increasing the number of preemptions in multiprocessor scheduling, Improved approaches to the exact solution of the machine covering problem, Streaming algorithms for multitasking scheduling with shared processing, An exact algorithm for parallel machine scheduling with conflicts, A parallel algorithm for GAC filtering of the Alldifferent constraint, A parallel adaptive grid algorithm for computational shock hydrodynamics, The longest processing time rule for identical parallel machines revisited, List scheduling revisited, Ordinal algorithms for parallel machine scheduling, On the value of job migration in online makespan minimization, Three-partitioning containing kernels: Complexity and heuristic, Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs, A common approximation framework for early work, late work, and resource leveling problems, A note on posterior tight worst-case bounds for longest processing time schedules, A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem, Offline file assignments for online load balancing, Improved approximation algorithms for data migration, Scheduling jobs with sizes and delivery times on identical parallel batch machines, Approximation for scheduling on uniform nonsimultaneous parallel machines, Online bin stretching with three bins, Improved algorithm for a generalized on-line scheduling problem on identical machines, Single machine scheduling with small operator-non-availability periods, Windows scheduling of arbitrary-length jobs on multiple machines, List factoring and relative worst order analysis, General parametric scheme for the online uniform machine scheduling problem with two different speeds, Bounds for parallel machine scheduling with predefined parts of jobs and setup time, The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds, A theory and algorithms for combinatorial reoptimization, Inefficiency of Nash equilibria with parallel processing policy, Approximate strong equilibria in job scheduling games with two uniformly related machines, Approximations for the two-machine cross-docking flow shop problem, A dynamic edge covering and scheduling problem: complexity results and approximation algorithms, Treemaps with bounded aspect ratio, An efficient algorithm for bin stretching, Scheduling with limited machine availability, Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays, Semi-online scheduling with ``end of sequence information, Best fit bin packing with random order revisited, On scheduling multiple two-stage flowshops, Single-machine scheduling with machine unavailability periods and resource dependent processing times, The piggyback transportation problem: transporting drones launched from a flying warehouse, Maximin share guarantee for goods with positive externalities, Scheduling on uniform processors with at most one downtime on each machine, Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks, Partitioned EDF scheduling: a closer look, Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games, Algorithms better than LPT for semi-online scheduling with decreasing processing times, A cutting plane approach for integrated planning and scheduling, A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria, Algorithms with limited number of preemptions for scheduling on parallel machines, The cost of selfishness for maximizing the minimum load on uniformly related machines, Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan, The effect of machine availability on the worst-case performance of LPT, Preemptive online algorithms for scheduling with machine cost, Greed in resource scheduling, Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers, A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem, Ideal schedules in parallel machine settings, Exact lexicographic scheduling and approximate rescheduling, Machine scheduling with soft precedence constraints, Variable neighborhood descent applied to multi-way number partitioning problem, Improved approximation algorithms for two-stage flowshops scheduling problem, A unified view of parallel machine scheduling with interdependent processing rates, An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time, On index policies for stochastic minsum scheduling, Approximation algorithms for the multiprocessor scheduling with submodular penalties, Parallel machines scheduling with machine shutdowns, On the price of anarchy of two-stage machine scheduling games, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Makespan minimization with OR-precedence constraints, Approximate and robust bounded job start scheduling for Royal Mail delivery offices, Online makespan scheduling with job migration on uniform machines, On scheduling inclined jobs on multiple two-stage flowshops, Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem, Optimizing crew rostering with multilicense on high-speed railway lines, Acceleration strategies for explicit finite element analysis of metal powder-based additive manufacturing processes using graphical processing units, Simultaneous approximation ratios for parallel machine scheduling problems, A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model, New results on competitive analysis of online SRPT scheduling, Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\), Tighter price of anarchy for selfish task allocation on selfish machines, Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs, Unconstrained static scheduling with communication weights, Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time, Off-line temporary tasks assignment., Approximation algorithms for routing and call scheduling in all-optical chains and rings., Scheduling with an orthogonal resource constraint, Optimal preemptive semi-online scheduling to minimize makespan on two related machines, A new approach for bicriteria partitioning problem, Algorithms for dynamic scheduling of unit execution time tasks, A note on the Coffman-Sethi bound for LPT scheduling, An introduction to the analysis of approximation algorithms, A survey on makespan minimization in semi-online environments, Feasibility of scheduling lot sizes of two frequencies on one machine, Nonclairvoyant scheduling, Optimal distribution strategies with cyclic demands, \texttt{mplrs}: a scalable parallel vertex/facet enumeration code, A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis, The rate of convergence to optimality of the LPT rule, Heuristics for parallel machine scheduling with delivery times, Sensitivity analysis of list scheduling heuristics, A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints, A robust strategy approach to a strategic mobility problem, Scheduling with incompatible jobs, A new enumeration scheme for the knapsack problem, List scheduling algorithms to minimize the makespan on identical parallel machines, On the worst-case ratio of a compound multiprocessor scheduling algorithm, UET scheduling with unit interprocessor communication delays, Tighter bounds on a heuristic for a partition problem, Modelling and scheduling a batch-type production on identical machines, Tight upper bounds for semi-online scheduling on two uniform machines with known optimum, Bin packing with divisible item sizes, Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times, Multiprocessor scheduling with interprocessor communication delays, Solving large batches of traveling salesman problems with parallel and distributed computing, Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities, Multiprocessor scheduling: Combining LPT and MULTIFIT, Random allocation of jobs with weights and precedence, Exact and heuristic algorithms for thrift cyclic scheduling, Makespan minimization in preemptive two machine job shops, Localizing combinatorial properties of partitions, Scheduling on identical machines: How good is LPT in an on-line setting?, The exact bound of Lee's MLPT, A two-phase algorithm for bin stretching with stretching factor 1.5, Using duplication for scheduling unitary tasks on m processors with unit communication delays, Sharing video on demand, 1-optimality of static BSP computations: Scheduling independent chains as a case study., Efficient scheduling of tasks without full use of processor resources, Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities, A survey of scheduling methods for multiprocessor systems, When greediness fails: examples from stochastic scheduling., General approximation algorithms for some arithmetical combinatorial problems, Improved 0/1-interchange scheduling, Divider-based algorithms for hierarchical tree partitioning., Optimal on-line algorithms to minimize makespan on two machines with resource augmentation, Tighter bound for MULTIFIT scheduling on uniform processors, Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint, Parametric bounds for LPT scheduling on uniform processors, A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes, \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems, Deterministic monotone algorithms for scheduling on related machines, Models and formal verification of multiprocessor system-on-chips, List scheduling for jobs with arbitrary release times and similar lengths, Nash equilibria in discrete routing games with convex latency functions, An algorithm for flow time minimization and its asymptotic makespan properties, Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints, A heuristic for preemptive scheduling with set-up times, New efficiency results for makespan cost sharing, Randomized priority algorithms, Iterated greedy local search methods for unrelated parallel machine scheduling, Resource constrained scheduling as generalized bin packing, The ratio of the extreme to the sum in a random sequence, Fast payment schemes for truthful mechanisms with verification, Extension of algorithm list scheduling for a semi-online scheduling problem, Coordination mechanisms for selfish scheduling, A general lower bound for the makespan problem, Semi on-line algorithms for the partition problem, \(k\)-partitioning problems with partition matroid constraint, Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times, Fair cost-sharing methods for scheduling jobs on parallel machines, Tighter approximation bounds for LPT scheduling in two special cases, A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, Semi-online machine covering for two uniform machines, Partitioning under the \(L_p\) norm, Scheduling jobs with time-resource tradeoff via nonlinear programming, On truthfulness and approximation for scheduling selfish tasks, A hybrid two-stage flowshop with part family, batch production, major and minor set-ups, List schedules for cyclic scheduling, Approximation algorithms for partitioning small items in unequal bins to minimize the total size, Minimizing makespan subject to minimum total flow-time on identical parallel machines, On a methodology for discrete-continuous scheduling, Equilibria in load balancing games, The \(k\)-partitioning problem, The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines, Approximation algorithms for the multiprocessor open shop scheduling problem, A tight upper bound for the \(k\)-partition problem on ideal sets, Optimal scheduling on parallel machines for a new order class, A tight bound for 3-partitioning, Performance of scheduling algorithms for no-wait flowshops with parallel machines, Worst-case analysis of heuristics for open shops with parallel machines, First fit decreasing scheduling on uniform multiprocessors, On-line scheduling with precedence constraints, On scheduling send-graphs and receive-graphs under the LogP-model, On an on-line scheduling problem for parallel jobs, Some recent results in the analysis of greedy algorithms for assignment problems, Extending Graham's result on scheduling to other heuristics, List scheduling in a parallel machine environment with precedence constraints and setup times, A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective, Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times, A new on-line scheduling heuristic, A note on on-line scheduling with precedence constraints on identical machines, Vector scheduling with rejection on two machines, Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints, New Algorithmic Results for Bin Packing and Scheduling, A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage, Exponential size neighborhoods for makespan minimization scheduling, Balancing perfectly periodic service schedules: An application from recycling and waste management, List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan, Task scheduling in networks, A Packing Problem You Can Almost Solve by Sitting on Your Suitcase, Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms, Two for One: Tight Approximation of 2D Bin Packing, A dual criteria sequencing problem with earliness and tardiness penalties, Machine scheduling performance with maintenance and failure, A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME, ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER, Unnamed Item, Unnamed Item, Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems, Semi-online scheduling: a survey, Ordinal Maximin Share Approximation for Goods, On-line bin packing ? A restricted survey, The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing, Strategic Scheduling Games: Equilibria and Efficiency, Unnamed Item, Unnamed Item, Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations, A genetic algorithm for solving the economic lot scheduling problem in flow shops, Unnamed Item, Resource Allocation Games with Multiple Resource Classes, On the dynamics of a shock–bubble interaction, On Approximation Algorithms for Two-Stage Scheduling Problems, Algorithms, Performance of Garey-Johnson algorithm for pipelined typed tasks systems, An improved delayed-start LPT algorithm for a partition problem on two identical parallel machines, Online Makespan Scheduling with Job Migration on Uniform Machines, Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover, A Family of Scheduling Algorithms for Hybrid Parallel Platforms, Robust surgery loading, Approximate Strong Equilibrium in Job Scheduling Games, Analysis of a linearization heuristic for single-machine scheduling to maximize profit, Selfish routing with incomplete information, Assembly of finite element methods on graphics processors, Scheduling malleable tasks with interdependent processing rates: comments and observations, TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING, A note on LPT scheduling, Semi-online scheduling with decreasing job sizes, An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays, Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines, Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule, A note on LPT scheduling, Fault-tolerant scheduling in homogeneous real-time systems, Scheduling batch processing machines with incompatible job families, Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times, Reductions, completeness and the hardness of approximability, Bounds for the cardinality constrained \(P \|C_{max}\) problem, Minimizing labor requirements in a periodic vehicle loading problem, Phase transition and finite-size scaling for the integer partitioning problem, Minimizing makespan subject to minimum flowtime on two identical parallel machines, Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families, Scheduling experiments on a nulear reactor using mixed integer programming, Efficient scheduling of periodic information monitoring requests, A linear time approximation algorithm for multiprocessor scheduling, A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately, Sensitivity analysis of scheduling algorithms, A common due-data assignment problem on parallel identical machines, Unnamed Item, Load balancing of temporary tasks in the \(\ell _{p}\) norm, Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines, List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity, On-line bin-stretching, On-line scheduling of parallel jobs with runtime restrictions, A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines, Parallel machine scheduling problems with proportionally deteriorating jobs, Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan, LPT online strategy for parallel-machine scheduling with kind release times, Dynamic query scheduling in parallel data warehouses, Two-machine scheduling with periodic availability constraints to minimize makespan, A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs, Buffer minimization with conflicts on a line, Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems, Scheduling DAGs with random parallel tasks on binarily partitionable systems, Min-Max partitioning problem with matroid constraint, Heuristic scheduling of parallel machines with sequence-dependent set-up times, Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs, NP-Complete operations research problems and approximation algorithms, Closing the Gap for Makespan Scheduling via Sparsification Techniques, Best Fit Bin Packing with Random Order Revisited, Unnamed Item, Optimal scheduling for two-processor systems, Unnamed Item, Approximation scheduling algorithms: a survey, On minimizing the makespan when some jobs cannot be assigned on the same machine, REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE, ON MESSAGE PACKAGING IN TASK SCHEDULING FOR DISTRIBUTED MEMORY PARALLEL MACHINES, Machine scheduling models in environmentally focused chemical manufacturing, A load balancing strategy for parallel computation of sparse permanents, Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines, Parallelization strategies for bee colony optimization based on message passing communication protocol, Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System, Algorithms for single machine scheduling problem with release dates and submodular penalties, Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties, Mixed coordination mechanisms for scheduling games on hierarchical machines, Worst-case analysis of LPT scheduling on a small number of non-identical processors, An on-line algorithm for some uniform processor Scheduling, Configuration balancing for stochastic requests, Malleable scheduling beyond identical machines, Well-behaved online load balancing against strategic jobs, Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods, A massively parallel implementation of multilevel Monte Carlo for finite element models, Parallel solutions for preemptive makespan scheduling on two identical machines, Instability of LRTF multiclass queueing networks, The LPT heuristic for minimizing total load on a proportionate openshop, An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts, Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines, Scheduling games with rank-based utilities, Relative Worst-Order Analysis: A Survey, Approximation scheme for single-machine rescheduling with job delay and rejection, The constrained parallel-machine scheduling problem with divisible processing times and penalties, Parallel solutions for ordinal scheduling with a small number of machines, Scheduling with machine conflicts, On scheduling multiple parallel two-stage flowshops with Johnson's rule, Load rebalancing games in dynamic systems with migration costs
