A class of manpower scheduling problems (Q4000927): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Scheduling via Integer Programs with Circular Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network model for nursing staff scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nurse Scheduling Using Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Manpower Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unnetworks, with Applications to Idle Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduiing of Two Consecutive Idle Periods / rank
 
Normal rank

Revision as of 10:39, 16 May 2024

scientific article
Language Label Description Also known as
English
A class of manpower scheduling problems
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references