Fixed interval scheduling: models, applications, computational complexity and algorithms
type: Item
instance of: scholarly article
title: Fixed interval scheduling: models, applications, computational complexity and algorithms
zbMATH Open document ID: 1107.90019
author: N. E. Zubov
published in: European Journal of Operational Research
publication date: 2007-01-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 5117698
zbMATH Keywords: binterval scheduling
zbMATH Keywords: interval graph
zbMATH Keywords: \(k\)-coloring
zbMATH Keywords: \(k\)-track assignment
zbMATH Keywords: discrete starting times
zbMATH Keywords: maximum weight clique
zbMATH Keywords: maximum weight independent set
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.01.049
OpenAlex ID: W2051158805
cites work: Q3056948
cites work: Scheduling jobs with fixed start and end times
cites work: A fast algorithm for the maximum weight clique problem
cites work: Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
cites work: Early/tardy scheduling with sequence dependent setups on uniform parallel machines
cites work: On the Maximum Weight Clique Problem
cites work: Reactive local search for the maximum clique problem
cites work: Approximating the throughput of multiple machines in real-time scheduling
cites work: A unified approach to approximating resource allocation and scheduling
cites work: On the power of randomization in on-line algorithms
cites work: Q4449217
cites work: On standard quadratic optimization problems
cites work: Q3145799
cites work: Global escape strategies for maximizing quadratic forms over a simplex
cites work: Interval scheduling on identical machines
cites work: The seat reservation problem
cites work: The \(k\)-track assignment problem
cites work: Bounding the Power of Preemption in Randomized Scheduling
cites work: On the \(k\)-coloring of intervals
cites work: When Is the Classroom Assignment Problem Hard?
cites work: Algorithms - ESA 2003
cites work: Approximation algorithms for NMR spectral peak assignment.
cites work: A generalization of chordal graphs and the maximum clique problem
cites work: Recognizing Berge graphs
cites work: The strong perfect graph theorem
cites work: Progress on perfect graphs
cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q4472496
cites work: Interval selection: Applications, algorithms, and lower bounds
cites work: A Greedy On-Line Algorithm for thek-Track Assignment Problem
cites work: Note on scheduling intervals on-line
cites work: A branch-and-price algorithm for a hierarchical crew scheduling problem
cites work: Q4418383
cites work: Approximation Algorithms for Fixed Job Schedule Problems
cites work: On chain and antichain families of a partially ordered set
cites work: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
cites work: Scheduling jobs within time windows on identical parallel machines: New model and algorithms
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: Maximum weight independent sets and cliques in intersection graphs of filaments
cites work: Minimal Resources for Fixed and Variable Job Schedules
cites work: Continuous Characterizations of the Maximum Clique Problem
cites work: Q3328583
cites work: Geometric algorithms and combinatorial optimization.
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization''
cites work: An Optimal Solution for the Channel-Assignment Problem
cites work: A simple optimal algorithm for scheduling variable-sized requests
cites work: Minimizing the sum of job earliness and tardiness in a multimachine system
cites work: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
cites work: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
cites work: Q5687246
cites work: On the complexity of scheduling tasks with discrete starting times
cites work: Q3050157
cites work: On the computational complexity of (maximum) class scheduling
cites work: Q4871783
cites work: Periodic assignment and graph colouring

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: A note on the maximum number of on-time jobs on parallel identical machines.

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Q4130999

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Q3128889

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: The combinatorics of pivoting for the maximum weight clique.

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Q4472034

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: A heuristic approach to the bus driver scheduling problem

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: An improved randomized on-line algorithm for a weighted interval selection problem

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Q4449246

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Properties of vertex packing and independence system polyhedra

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Vertex packings: Structural properties and algorithms

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: A sequential algorithm for finding a maximum weightK-independent set on interval graphs

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: A branch and bound algorithm for the maximum clique problem

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: A primal-dual interior point method whose running time depends only on the constraint matrix

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Maximum weightk-independent set problem on permutation graphs

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Maximum \(k\)-covering of weighted transitive graphs with applications

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Polyhedral proof methods in combinatorial optimization

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Randomized online interval scheduling

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Real time scheduling theory: A historical perspective

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Convergence rate of the gradient descent method with dilatation of the space

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Dual quadratic estimates in polynomial and Boolean programming

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Parallel machine scheduling with earliness and tardiness penalties

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: On the approximability of an interval scheduling problem

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: A unified analysis of paging and caching

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: Aligning two fragmented sequences

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: The relation of time indexed formulations of single machine scheduling problems to the node packing problem

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: On-line scheduling of jobs with fixed start and end times

Fixed interval scheduling: models, applications, computational complexity and algorithms (cites work)
cites work: The maximum k-colorable subgraph problem for chordal graphs

Fixed interval scheduling: models, applications, computational complexity and algorithms (DOI)
DOI: 10.1016/J.EJOR.2006.01.049