An analysis of shift class design problems (Q1342640): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Leo G. Kroon / rank
Normal rank
 
Property / author
 
Property / author: Leo G. Kroon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139214056 / 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: When Is the Classroom Assignment Problem Hard? / 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: Games of Boldness, Where the Player Performing the Hardest Task Wins / 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: Q4198056 / 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: Q3328583 / 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: On the computational complexity of (maximum) shift class scheduling / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:24, 23 May 2024

scientific article
Language Label Description Also known as
English
An analysis of shift class design problems
scientific article

    Statements

    An analysis of shift class design problems (English)
    0 references
    0 references
    0 references
    30 May 1995
    0 references
    0 references
    fixed job schedule problem
    0 references
    aircraft maintenance process
    0 references
    worst case behaviour
    0 references
    preemptive variant verses the non-preemptive variant
    0 references
    0 references