Two-Processor Scheduling with Start-Times and Deadlines
From MaRDI portal
Publication:4146529
Cited in
(only showing first 100 items - show all)- Efficient algorithms for scheduling parallel jobs with interval constraints in clouds
- Fixed edge-length graph drawing is NP-hard
- Performance of Garey-Johnson algorithm for pipelined typed tasks systems
- Open shop problems with unit time operations
- Effective iterative algorithms in scheduling theory
- Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets
- Equivalent approximation algorithms for node cover
- Arbres avec un nombre maximum de sommets pendants
- Fall colouring of bipartite graphs and Cartesian products of graphs
- Two-segmented channel routing is strong NP-complete
- Computing maximum mean cuts
- On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- Efficient web searching using temporal factors
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Some results of the relocation problems with processing times and deadlines
- Encryption using Hungarian rings
- Probabilistic single processor scheduling
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- No-hole (r+1)-distant colorings
- Reconstructing sets of orthogonal line segments in the plane
- Finding efficient make-to-order production and batch delivery schedules
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints
- Linear logic for nets with bounded resources
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
- Scheduling with forbidden sets
- Scheduling with tails and deadlines
- The complexity of changing colourings with bounded maximum degree
- Recognizing graphs with fixed interval number is NP-complete
- Absolute retracts and varieties generated by chordal graphs
- A note on a theorem by Ladner
- Universal number partition problem with divisibility
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- Approximating a vehicle scheduling problem with time windows and handling times
- Embeddings of graphs
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- Performance evaluation of concurrent systems using conflict-free and persistent Petri nets
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Shelf algorithms for on-line strip packing
- Irreversible conversion of graphs
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- Tree scheduling with communication delays
- Interior and exterior functions of Boolean functions
- k-optimal solution sets for some polynomially solvable scheduling problems
- Scheduling Opposing Forests
- A simplified NP-complete MAXSAT problem
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Data sufficiency for queries on cache
- On the complexity of Boolean unification
- Computing independent sets in graphs with large girth
- Equational unification, word unification, and 2nd-order equational unification
- Multilevel planarity
- On a multiconstrained model for chromatic scheduling
- On Ringeisen's isolation game
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- The external constraint 4 nonempty part sandwich problem
- A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace
- Ideal schedules in parallel machine settings
- An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
- Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard
- Boolean minors
- Solving the traveling repairman problem on a line with general processing times and deadlines
- The complexity of generalized graph colorings
- On the complexity of partitioning graphs into connected subgraphs
- How well can a graph be n-colored?
- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
- On the minimum label spanning tree problem
- On the complexity of the independent set problem in triangle graphs
- On the r,s-SAT satisfiability problem and a conjecture of Tovey
- An improved algorithm for online machine minimization
- Distance graphs and the T-coloring problem
- A study of the application of Kohonen-type neural networks to the travelling salesman problem
- An iterative algorithm for scheduling UET tasks with due dates and release times.
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- The \(k\)-SATISFIABILITY problem remains NP-complete for dense families
- Reversible iterative graph processes
- Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines
- Some complexity results about threshold graphs
- Algorithms for dynamic scheduling of unit execution time tasks
- An efficient algorithm for finding ideal schedules
- Breaking \(1-1/e\) barrier for nonpreemptive throughput maximization
- Throughput scheduling with equal additive laxity
- Throughput scheduling with equal additive laxity
- Flexible open shop scheduling problem to minimize makespan
- Improved parameterized algorithms for scheduling with precedence constraints and time windows
- Sharing jugs of wine
- Hamiltonian paths in Cayley graphs
- Partitions of graphs into one or two independent sets and cliques
- The worst-case analysis of the Garey-Johnson algorithm
- On the depth of combinatorial optimization problems
- Scheduling for multi-robot routing with blocking and enabling constraints
- NP-completeness of some generalizations of the maximum matching problem
- Single machine scheduling with release times, deadlines and tardiness objectives
- Open neighborhood locating-dominating in trees
- Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
- On approximation problems related to the independent set and vertex cover problems
- On budget-constrained flow improvement.
- Shiftable intervals
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)