On the complexity of manpower shift scheduling (Q1906950): 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: On Manpower Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Workforce Scheduling with Cyclic Demands and Day-Off Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modular Approach to Optimal Multiple-Shift Manpower Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-level bottleneck assignment approach to the bus drivers' rostering problem / 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: Multiple Shift Workforce Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877300 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525756 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0305-0548(94)00094-o / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4243899040 / rank
 
Normal rank

Latest revision as of 10:24, 30 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of manpower shift scheduling
scientific article

    Statements

    Identifiers