Two-Processor Scheduling with Start-Times and Deadlines

Cited in

(only showing first 100 items - show all)

Fall colouring of bipartite graphs and Cartesian products of graphs
Hamiltonian paths in Cayley graphs
A note on a theorem by Ladner
Approximations to clustering and subgraph problems on trees
On the complexity of partitioning graphs into connected subgraphs
Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets
Equivalent approximation algorithms for node cover
Encryption using Hungarian rings
Performance evaluation of concurrent systems using conflict-free and persistent Petri nets
k-optimal solution sets for some polynomially solvable scheduling problems
The complexity of planar graph choosability
Equational unification, word unification, and 2nd-order equational unification
Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
How well can a graph be n-colored?
Balancing signed graphs
NP-completeness of some generalizations of the maximum matching problem
Computing independent sets in graphs with large girth
Hamiltonian cycle is polynomial on cocomparability graphs
Deadline scheduling of tasks with ready times and resource constraints
On a multiconstrained model for chromatic scheduling
Distance graphs and the T-coloring problem
Embeddings of graphs
Sharing jugs of wine
The \(k\)-SATISFIABILITY problem remains NP-complete for dense families
Tree scheduling with communication delays
Some complexity results about threshold graphs
Computing maximum mean cuts
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
On an approximation measure founded on the links between optimization and polynomial approximation theory
On semi-\(P_ 4\)-sparse graphs
Two-segmented channel routing is strong NP-complete
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
An iterative algorithm for scheduling UET tasks with due dates and release times.
On the minimum label spanning tree problem
Normal-form preemption sequences for an open problem in scheduling theory
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
On the depth of combinatorial optimization problems
Fixed edge-length graph drawing is NP-hard
On \({\mathbb{K}}^{\Delta}\)
On the r,s-SAT satisfiability problem and a conjecture of Tovey
An algebraic point of view of the data structures of database systems
Algorithms for dynamic scheduling of unit execution time tasks
Boolean minors
Partitions of graphs into one or two independent sets and cliques
Linear logic for nets with bounded resources
Interior and exterior functions of Boolean functions
The complexity of generalized graph colorings
A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace
Ideal schedules in parallel machine settings
Scheduling for multi-robot routing with blocking and enabling constraints
On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times
Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
Efficient algorithms for scheduling parallel jobs with interval constraints in clouds
Finding efficient make-to-order production and batch delivery schedules
The worst-case analysis of the Garey-Johnson algorithm
Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
On the complexity of the independent set problem in triangle graphs
The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
An improved algorithm for online machine minimization
Shiftable intervals
Approximating a vehicle scheduling problem with time windows and handling times
On budget-constrained flow improvement.
Shelf algorithms for on-line strip packing
A simplified NP-complete MAXSAT problem
Data sufficiency for queries on cache
On the complexity of Boolean unification
Performance of Garey-Johnson algorithm for pipelined typed tasks systems
Solving the traveling repairman problem on a line with general processing times and deadlines
Flexible open shop scheduling problem to minimize makespan
Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
Effective iterative algorithms in scheduling theory
Some results of the relocation problems with processing times and deadlines
Open shop problems with unit time operations
The complexity of changing colourings with bounded maximum degree
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
Coordinated scheduling of production and delivery with production window and delivery capacity constraints
Universal number partition problem with divisibility
A polyhedral study of the asymmetric traveling salesman problem with time windows
An O( m)-competitive algorithm for online machine minimization
Scheduling Opposing Forests
Breaking 1-1/e barrier for nonpreemptive throughput maximization
The external constraint 4 nonempty part sandwich problem
Parameterized complexity of coloring problems: treewidth versus vertex cover
Irreversible conversion of graphs
Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
Multilevel planarity
Throughput scheduling with equal additive laxity
Throughput scheduling with equal additive laxity
Scheduling with tails and deadlines
Single machine scheduling with release times, deadlines and tardiness objectives
Efficient web searching using temporal factors
Scheduling with forbidden sets
Open neighborhood locating-dominating in trees
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
Bounded vertex colorings of graphs
Improved parameterized algorithms for scheduling with precedence constraints and time windows
Reconstructing sets of orthogonal line segments in the plane
No-hole (r+1)-distant colorings
Reversible iterative graph processes

This page was built for publication: Two-Processor Scheduling with Start-Times and Deadlines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146529)