NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness

Scheduling: Theory, Algorithms, and Systems

Michael Pinedo · IIE Transactions · 1996 · 6.3K citations

A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem

Muhammad Nawaz, E. Emory Enscore, Inyong Ham · Omega · 1983 · 2.5K citations

Job Scheduler, Engineering, Heuristic Algorithm +13

Some efficient heuristic methods for the flow shop sequencing problem

Éric D. Taillard · European Journal of Operational Research · 1990 · 853 citations

Engineering, Industrial Engineering, Scheduling Problem +10

Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

S. S. Panwalkar, Marquard Smith, Abraham Seidmann · Operations Research · 1982 · 411 citations

Mathematical Programming, Machine Scheduling Problem, Job Scheduler +14

A decomposition algorithm for the single machine total tardiness problem

Chris N. Potts, L. N. Van Wassenhove · Operations Research Letters · 1982 · 300 citations

Mathematical Programming, Engineering, Decomposition Algorithm +9