Lower bounds and heuristic algorithms for the k

We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of values in a subset is minimized, and the number of values in each subset does not exceed the corresponding limit. The problem is related to scheduling and bin packing problems. We give combinatorial lower bounds, reduction criteria, constructive heuristics, a scatter search approach, and a lower bound based on column generation. The outcome of extensive computational experiments is presented.

[1]  A. Frangioni,et al.  A multi-exchange neighborhood for minimum makespan machine , 2000 .

[2]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[3]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: practical and theoretical results , 1987 .

[4]  Pablo Moscato,et al.  Comparing meta-heuristic approaches for parallel machine scheduling problems , 2002 .

[5]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[6]  Fred W. Glover,et al.  Applying tabu search with influential diversification to multiprocessor scheduling , 1994, Comput. Oper. Res..

[7]  F. Glover,et al.  Scatter Search and Path Relinking: Foundations and Advanced Designs , 2004 .

[8]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[9]  Maria Grazia Scutellà,et al.  A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems , 2004, J. Comb. Optim..

[10]  S.M.T. Fatemi Ghomi,et al.  A pairwise interchange algorithm for parallel machine scheduling , 1998 .

[11]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[12]  S. Martello,et al.  Bounds for the cardinality constrained P∥Cmax problem , 2001 .

[13]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[14]  Ellis Horowitz,et al.  A linear time approximation algorithm for multiprocessor scheduling , 1979 .

[15]  F. Glover.  Scatter search and path relinking , 1999 .

[16]  Hans Kellerer,et al.  Thek-partitioning problem , 1998, Math. Methods Oper. Res..

[17]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[18]  G. S. Lueker,et al.  Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics , 1988 .

[19]  Mauro Dell'Amico,et al.  Optimal Scheduling of Tasks on Identical Parallel Processors , 1995, INFORMS J. Comput..

[20]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[21]  Mauro Dell'Amico,et al.  Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem , 2004, J. Heuristics.

[22]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[23]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

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

[25]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[26]  Ethel Mokotoff,et al.  List scheduling algorithms to minimize the makespan on identical parallel machines , 2001 .

[27]  Godfrey C. Onwubolu,et al.  New optimization techniques in engineering , 2004, Studies in Fuzziness and Soft Computing.

[28]  Paolo Toth,et al.  Worst-case analysis of greedy algorithms for the subset-sum problem , 1984, Math. Program..

[29]  Paolo Toth,et al.  An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem , 2003, Oper. Res..

[30]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .