共 2 条
[1]
A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems.[J] Antonio Frangioni;Emiliano Necciari;Maria Grazia Scutellà J. Comb. Optim. 2004,
[2]
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard[J] J.A. Hoogeveen;J.K. Lenstra;B. Veltman European Journal of Operational Research 1996,

