Integer preemptive scheduling on parallel machines

Scheduling chain-structured tasks to minimize makespan and mean flow time

Jianzhong Du, Joseph Y.‐T. Leung, Gilbert H. Young · Information and Computation · 1991 · 102 citations

Management, Industrial Engineering, Operations Management +11

Ten notes on equal-processing-time scheduling

Philippe Baptiste, Peter Brucker, Sigrid Knust et al. · 4OR · 2004 · 54 citations

Computing, Computer Engineering, Computer Science +7

Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity

Vadim G. Timkovsky · European Journal of Operational Research · 2003 · 27 citations

Management, Computer Science, Industrial Engineering +9

How useful are preemptive schedules?

Peter Brucker, Silvia Heitmann, Johann L. Hurink · Operations Research Letters · 2003 · 19 citations · Full text

Management, Industrial Engineering, Scheduling +9

On preemption redundancy in scheduling unit processing time jobs on two parallel machines

Philippe Baptiste, Vadim G. Timkovsky · Operations Research Letters · 2001 · 17 citations

Management, Computer Engineering, Computer Science +15