Scheduling with Deadlines and Loss Functions
From MaRDI portal
Publication:2768989
DOI10.1287/mnsc.6.1.1zbMath1047.90504OpenAlexW2058817479MaRDI QIDQ2768989
Publication date: 22 October 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/746ac1e37383b8f262dabcb1575fafde9b6a6389
Related Items
An introduction to parallelism in combinatorial optimization, Nonclairvoyant scheduling, Parametric analysis of the quality of single preemption schedules on three uniform parallel machines, Minimizing mean flow time with parallel processors and resource constraints, Batch scheduling with deadlines on parallel machines: an NP-hard case, Openshop and flowshop scheduling to minimize sum of completion times, A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions, Preemption in single machine earliness/tardiness scheduling, Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems, Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays, A study of the cyclic scheduling problem on parallel processors, Nearly on line scheduling of preemptive independent tasks, List scheduling algorithms to minimize the makespan on identical parallel machines, Real-time scheduling of linear speedup parallel tasks, Total completion time minimization on multiple machines subject to machine availability and makespan constraints, On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost, Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors, Rational preemptive scheduling, An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem, Parallel machine scheduling problem with preemptive jobs and transportation delay, ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times, New trends in machine scheduling, Approximate algorithms for the \(P\parallel C_{\max}\) problem, Models and complexity of multibin packing problems, Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints, Pre-emptive scheduling problems with controllable processing times, Scheduling parallel jobs to minimize the makespan, On a parallel machine scheduling problem with precedence constraints, A parametric maximum flow algorithm for bipartite graphs with applications, Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays, Is a unit-job shop not easier than identical parallel machines?, Redundant cumulative constraints to compute preemptive bounds, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Scheduling multiprocessor tasks on parallel processors with limited availability., Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach, Online scheduling of unit jobs on three machines with rejection: a tight result, Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors, Scheduling chained multiprocessor tasks onto large multiprocessor system, A survey of scheduling methods for multiprocessor systems, Search-based job shop scheduling and sequencing: Extensions to the search sequencing rule, {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling, How useful are preemptive schedules?, An exact algorithm for the identical parallel machine scheduling problem., Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines, An optimal boundary fair scheduling algorithm for multiprocessor real-time systems, A state-of-the-art review of parallel-machine scheduling research, Scheduling open shops with parallel machines, Approximation results in parallel machines stochastic scheduling, Reducibility among single machine weighted completion time scheduling problems, A competitive two-agent scheduling problem on parallel machines with release dates and preemption, Semantic-aware optimization of user interface menus, Parallel machine covering with limited number of preemptions, Approximation schemes for packing with item fragmentation, Equivalence of mean flow time problems and mean absolute deviation problems, Robust algorithms for preemptive scheduling, Scheduling results applicable to decision-theoretic troubleshooting, Sequencing jobs on a single machine with a common due data and stochastic processing times, Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems, Minimizing the maximal ergonomic burden in intra-hospital patient transportation, T-L plane-based real-time scheduling for homogeneous multiprocessors, Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs, On the geometry, preemptions and complexity of multiprocessor and shop scheduling, A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes, Bin packing with fragmentable items: presentation and approximations, Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness, A study of scheduling problems with preemptions on multi-core computers with GPU accelerators, Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources, Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches, Parallel machine scheduling with speed-up resources, A heuristic for preemptive scheduling with set-up times, Complexity and approximation of an area packing problem, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, Scheduling on parallel machines with preemption and transportation delays, A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time, Scheduling unrelated parallel machines with optional machines and jobs selection, A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity, Scheduling two agents with controllable processing times, Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem, Minimizing mean weighted execution time loss on identical and uniform processors, Iterated greedy local search methods for unrelated parallel machine scheduling, Synchronous flow shop scheduling with pliable jobs, Packing resizable items with application to video delivery over wireless networks, A polynomial algorithm for an open shop problem with unit processing times and tree constraints, Preemptive scheduling with variable profile, precedence constraints and due dates, Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times, Preemptive online scheduling: Optimal algorithms for all speeds, Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, Batch scheduling with deadlines on parallel machines, Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure, Scheduling multiprocessor tasks with chain constraints, Parallel machine scheduling with splitting jobs, The single-machine total tardiness scheduling problem: review and extensions, Optimal virtual cluster-based multiprocessor scheduling, Minimizing average completion time in the presence of release dates, Minimizing the number of machines for minimum length schedules, Resource augmentation in load balancing., A heuristic for the single machine tardiness problem, Linear and quadratic algorithms for scheduling chains and opposite chains, Linear programming models for load balancing, An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Approximation algorithms for minimizing the total weighted tardiness on a single machine, Approximation schemes for parallel machine scheduling problems with controllable processing times, Towards Tight Lower Bounds for Scheduling Problems, Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms, Scheduling jobs that arrive over time, A survey of scheduling with controllable processing times, Separating online scheduling algorithms with the relative worst order ratio, The maximum gain of increasing the number of preemptions in multiprocessor scheduling, Fundamental principles of analogue computers, Unnamed Item, On subdirect sums of ordered groups, Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times, On a problem of an elastic quarter plane, An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates, A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times, An optimal online algorithm for scheduling with general machine cost functions, An optimal algorithm for preemptive on-line scheduling, Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, Unnamed Item, A greedy algorithm for the social golfer and the Oberwolfach problem, Schedules with a single preemption on uniform parallel machines, Unnamed Item, The benefit of preemption with respect to the \(\ell_p\) norm, Unnamed Item, Open shop problems with unit time operations, Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines, Speed scaling on parallel processors with migration, Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization, Task scheduling with precedence constraints to minimize the total completion time, On two-dimensional and three dimensional axially-symmetric rotational flows of an ideal incompressible fluid, A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, Unnamed Item, Vyacheslav Tanaev: contributions to scheduling and related areas, Unnamed Item, Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires, Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints, On lattice groups with two generators, Probabilities on non-commutative semigroups, Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach, Scheduling with batching: A review, Scheduling with limited machine availability, Some properties of Sobolev spaces with a weight function, Scheduling multiprocessor tasks for mean flow time criterion, Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information, Derivation of non-classical variational principles in the theory of elasticity, Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach, An optimal boundary fair scheduling, Job Tardiness in Unequal Parallel Processor Systems, Uniform parallel machine scheduling with resource consumption constraint, Scheduling flexible flow lines with no in-process buffers, A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS, Unnamed Item, Parallel machine scheduling with a convex resource consumption function, Algorithms with limited number of preemptions for scheduling on parallel machines, Scheduling on semi-identical processors, Minimizing flowtime subject to optimal makespan on two identical parallel machines, On scheduling parallel machines with two setup classes, Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines, Ideal schedules in parallel machine settings, Randomized on-line scheduling similar jobs to minimize makespan on two identical processors, Coupled task scheduling with exact delays: literature review and models, Preemptive semi-online algorithms for parallel machine scheduling with known total size, Algorithms for hierarchical and semi-partitioned parallel scheduling, Modeling single machine preemptive scheduling problems for computational efficiency, Shop scheduling problems with pliable jobs, Heuristic scheduling of parallel machines with sequence-dependent set-up times, Malleable scheduling for flows of jobs and applications to MapReduce, Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs, Parallel machine makespan minimization subject to machine availability and total completion time constraints, Scheduling chain-structured tasks to minimize makespan and mean flow time, A Survey on Approximation Algorithms for Scheduling with Machine Unavailability, Makespan minimization with OR-precedence constraints, Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes, Integrality Property in Preemptive Parallel Machine Scheduling, Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines, PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION, Simultaneous approximation ratios for parallel machine scheduling problems, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, Scheduling preemptive jobs with precedence constraints on parallel machines, Preemptive and non-preemptive scheduling on two unrelated parallel machines, Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem, How small are shifts required in optimal preemptive schedules?, Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time, A computational study of heuristics for two-stage flexible flowshops, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, Green scheduling, flows and matchings, Scheduling chains on uniform processors with communication delays, Scheduling multiprocessor tasks on two parallel processors, Iterated greedy algorithms for a complex parallel machine scheduling problem, New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria, A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines, Global solution of the first boundary value problem for a nonlinear parabolic equation by means of the grid method, Direct decompositions of partially ordered groups, II, Representation and extension of $l$-groups, Single machine sequencing with random processing times and random due‐dates, Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods, Efficient algorithms for flexible job shop scheduling with parallel machines, Parallel solutions for preemptive makespan scheduling on two identical machines, A survey on mixed-integer programming techniques in bilevel optimization, On the complexity of scheduling unrelated parallel machines with limited preemptions, Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques, Unnamed Item, Unnamed Item, Unnamed Item, Makespan minimization in online scheduling with machine eligibility, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES, Unnamed Item, Makespan minimization in online scheduling with machine eligibility, Unnamed Item, Periodic solutions of a weakly nonlinear wave equation in one dimension, Unnamed Item, Unnamed Item, Scheduling with unexpected machine breakdowns, On preemption redundancy in scheduling unit processing time jobs on two parallel machines, New applications of the Muntz and Coffman algorithm, Zeroes of orthogonal polynomials by QD-algorithm, A note on weighted completion time minimization in a flexible flow shop, Preemptive hybrid flowshop scheduling problem of interval orders, Unnamed Item, Preemptive multiprocessor scheduling with rejection, Unnamed Item, LPT online strategy for parallel-machine scheduling with kind release times, Contribution to the foundations of network theory using the distribution theory, II, A note on mixed abelian groups, On linear statistical problems in stochastic processes
