Multi-period Assignment Problem

The Multi-Period Assignment Problem is a dynamic optimization model that extends the classical assignment problem by allocating resources to tasks over multiple time periods, accounting for temporal dependencies, evolving constraints, and sequential decision-making under resource continuity requirements.

34

Publications

1.5K

Citations

88

Authors

60

Institutions

Publications per year

2017–2026

10

Authors

88

  1. LS
    Lori S. Franz

    University of Missouri, United States

    2 publications · 129 citations

    2

    h-index

  2. AS
    Andrea Schaerf

    University of Udine, Italy

    2 publications · 168 citations

    2

    h-index

  3. JL
    Janis L. Miller

    Clemson University, United States

    2 publications · 129 citations

    2

    h-index

  4. GA
    Gürsel A. Süer

    Ohio University, United States

    2 publications · 72 citations

    2

    h-index

  5. MV
    M.A. Venkataramanan

    Indiana University Bloomington, United States

    1 publications · 19 citations

    1

    h-index

1–5 of 88

Venues

  1. International Journal of Production Research

    5 publications · 165 citations

    5

    h-index

  2. European Journal of Operational Research

    4 publications · 164 citations

    4

    h-index

  3. Computers & Operations Research

    3 publications · 89 citations

    3

    h-index

  4. Computers & Industrial Engineering

    2 publications · 34 citations

    2

    h-index

  5. Omega

    2 publications · 59 citations

    2

    h-index

1–5