论文信息 - The bounded interval generalized assignment model

The bounded interval generalized assignment model

The bounded interval generalized assignment model is a “many‐for‐one” assignment model. Each task must be assigned to exactly one agent; however, each agent can be assigned multiple tasks as long as the agent resource consumed by performing the assigned tasks falls within a specified interval. The bounded interval generalized assignment model is formulated, and an algorithm for its solution is developed. Algorithms for the bounded interval versions of the semiassignment model and sources‐to‐uses transportation model are also discussed.

G. Ross | R. Soland | A. Zoltners

[1] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[2] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[3] Adriano O. De Maio,et al. An all Zero-One Algorithm for a Certain Class of Transportation Problems , 1971, Oper. Res..

[4] Richard L. Francis,et al. Solving a Segregated Storage Problem Using Branch-and-Bound and Extreme Point Ranking Methods , 1971 .

[5] V. Srinivasan,et al. An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems , 1973, Oper. Res..

[6] Howard Lee Morgan. Optimal space allocation on disk storage devices , 1974, CACM.

[7] Richard M. Soland,et al. A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..

[8] R. Trippi. The Warehouse Location Formulation as a Special Type of Inspection Problem , 1975 .

[9] V. Balachandran,et al. An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks , 1976, Oper. Res..

[10] Edward A. Stohr,et al. Management of Program Storage in Computers , 1976 .

[11] G. Ross,et al. Modeling Facility Location Problems as Generalized Assignment Problems , 1977 .

[12] Joseph G. Debanne,et al. Management Science in the Public Sector---The Estevan Case , 1979 .