Parallel Machine Due-date Scheduling

Parallel Machine Due-Date Scheduling is a scheduling problem in operations research and production planning where a set of jobs must be assigned to multiple identical parallel machines with the objective of determining optimal due dates and job sequences to minimize penalties associated with earliness, tardiness, or due-date assignment costs.

82

Publications

3.4K

Citations

176

Authors

107

Institutions

Publications per year

2017–2026

11

Authors

176

  1. TC
    T.C.E. Cheng

    Hong Kong Polytechnic University, Hong Kong SAR China

    5 publications · 149 citations

    5

    h-index

  2. JN
    Jatinder N.D. Gupta

    University of Alabama in Huntsville, United States

    3 publications · 91 citations

    3

    h-index

  3. GM
    Gur Mosheiov

    Hebrew University of Jerusalem, Israel

    3 publications · 67 citations

    3

    h-index

  4. MH
    Mohamed Haouari

    Qatar University, Qatar

    2 publications · 95 citations

    2

    h-index

  5. EM
    E. Max

    University of Connecticut, United States

    2 publications · 184 citations

    2

    h-index

1–5 of 176

Venues

  1. European Journal of Operational Research

    14 publications · 695 citations

    14

    h-index

  2. Computers & Operations Research

    10 publications · 411 citations

    10

    h-index

  3. 7

    h-index

  4. Journal of the Operational Research Society

    OR · 6 publications · 146 citations

    6

    h-index

  5. Computers & Industrial Engineering

    5 publications · 244 citations

    5

    h-index

1–5