Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.01.049 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051158805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Early/tardy scheduling with sequence dependent setups on uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Weight Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Throughput of Multiple Machines in Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization in on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global escape strategies for maximizing quadratic forms over a simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling on identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The seat reservation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-track assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Power of Preemption in Randomized Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-coloring of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Is the Classroom Assignment Problem Hard? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NMR spectral peak assignment. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of chordal graphs and the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval selection: Applications, algorithms, and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy On-Line Algorithm for thek-Track Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on scheduling intervals on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for a hierarchical crew scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Fixed Job Schedule Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chain and antichain families of a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs within time windows on identical parallel machines: New model and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets and cliques in intersection graphs of filaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Resources for Fixed and Variable Job Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Characterizations of the Maximum Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution for the Channel-Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple optimal algorithm for scheduling variable-sized requests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of job earliness and tardiness in a multimachine system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of scheduling tasks with discrete starting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of (maximum) class scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic assignment and graph colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the maximum number of on-time jobs on parallel identical machines. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The combinatorics of pivoting for the maximum weight clique. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach to the bus driver scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved randomized on-line algorithm for a weighted interval selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior point method whose running time depends only on the constraint matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight<i>k</i>-independent set problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-covering of weighted transitive graphs with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral proof methods in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized online interval scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real time scheduling theory: A historical perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rate of the gradient descent method with dilatation of the space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual quadratic estimates in polynomial and Boolean programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with earliness and tardiness penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of an interval scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified analysis of paging and caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aligning two fragmented sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relation of time indexed formulations of single machine scheduling problems to the node packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:49, 25 June 2024

scientific article
Language Label Description Also known as
English
Fixed interval scheduling: models, applications, computational complexity and algorithms
scientific article

    Statements

    Fixed interval scheduling: models, applications, computational complexity and algorithms (English)
    0 references
    0 references
    22 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    binterval scheduling
    0 references
    interval graph
    0 references
    \(k\)-coloring
    0 references
    \(k\)-track assignment
    0 references
    discrete starting times
    0 references
    maximum weight clique
    0 references
    maximum weight independent set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references