Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Relaxation Approach To The Classroom Assignment Problem<sup>*</sup> / 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: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fixed Job Schedule Problem with Spread-Time Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fixed Job Schedule Problem with Working-Time Constraints / 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: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / 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: An Optimal Solution for the Channel-Assignment Problem / 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: License class design: Complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(93)e0335-u / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2143702272 / rank
 
Normal rank

Latest revision as of 10:56, 30 July 2024

scientific article
Language Label Description Also known as
English
Exact and approximation algorithms for the operational fixed interval scheduling problem
scientific article

    Statements

    Exact and approximation algorithms for the operational fixed interval scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    11 June 1998
    0 references
    job scheduling
    0 references
    integer programming
    0 references
    Lagrangean relaxation
    0 references
    heuristics
    0 references
    operational fixed interval scheduling
    0 references
    job scheduling problem
    0 references
    assignment problem
    0 references
    0 references
    0 references

    Identifiers