Minimization of makespan in generalized assignment problem.

DOI10.1007/BF03398589zbMath1141.90505OpenAlexW2778088358MaRDI QIDQ2468617

Shalini Arora, Munish C. Puri

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398589

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• The generalized assignment problem: Valid inequalities and facets
• (1,k)-configuration facets for the generalized assignment problem
• A state-of-the-art review of parallel-machine scheduling research
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• A branch and bound algorithm for the generalized assignment problem
• An all Zero-One Algorithm for a Certain Class of Transportation Problems
• An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems

This page was built for publication: Minimization of makespan in generalized assignment problem.