Minimization of Makespan in Generalized Assignment Problem

H.L. BHATIA, “A note on a zero-one time minimizing problem”, NZOR 7 (1979) 159–165.

T.C.E. Cheng and C.C.S. Sin, “A state-of-art review of parallel machine scheduling research”, EJOR 47 (1990) 271–292.

M.L. FISHER, R. JAIKUMAR AND L.N. VAN WASSENHOVE, A multipher adjustment method for the generalized assignment problem”, Management Science 32 (1986) 1095–1103.

R. GARRY PARKER, “Deterministic Scheduling Theory”, Chapma and Hall (1995).

GHOSE AND SHILA, “The maximum capacity routes: A lexi-search approach”, Operations Research 8(3) (1971) 969–982.

E.S. GOTTLIEB AND M.R. RAO, “The generalized assignment problem: Valid inequalities and facets”, Mathematical Programming 46 (1990) 31–52.

E.S. GOTTLIEB AND M.R. RAO, “(1, k)-Configuration facets for the generalized assignment problem”, Mathematical Programming 46 (1990) 53–60.

T.D. KALSTORIN, “An effective subgradient algorithm for the generalized assignment problem”, Computers and Operations Research 6 (1979) 155–164.

E.L. LAWLER, J.K. LENSTRA, A.H.G. RINNOY KAN AND D.B. SHMOYS, “Sequencing and Scheduling: Algorithms and Complexity”, Report B5-R8909, Centre for Mathematics and Computers Science, Amsterdam (1989).

MAIO, ADRIANO DE AND C. ROVEDA, “An all zero-one algorithm for a certain class of transportation problem”, Operations Research 19 (1971) 1406–1418.

S. MARTELLO AND P. TOTH, “An algorithm for the generalized assignment problem”, In J.P. Brans (ed.), Operational Research, North-Holland Amsterdam 81 (1981) 589–603.

J.B MAZZOLA, A.W. NEEBE AND C.V.R. DUNN “Production planning of a flexible manufacturing system in a material requirements planning environment”, International Journal of Flexible Manufacturing Systems 1/2 (1989) 115–142.

M.S. MURTHY, “A bulk transportation problem”, Opsearch 13 (3–4) (1976) 143–155.

A. W. NEEB AND M.R. RAO, “An algorithm for the fixed - charge assigning users to sources problem”, Journal of Operational Research Society 34 (1983) 1107–1113.

S.N.N. PANDIT AND Y.V. SUBRAHMANYAM, “Enumeration of all optimal job sequence”, Opsearch 12 (1–2) (1975) 35–39.

G.T. ROSS AND R.M. SOLAND, “A branch and bound algorithm for the generalized assignment problem”, Mathematical Programming 8 (1975) 91–103.

V. SRINIVASAN AND G.L. THOMPSON, “An algorithm for assigning uses to sources in a special class of transportation problems”, Operations Research 21 (1973) 284–295.