An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times

Abstract

This article investigates identical parallel machines scheduling with family setup times. The objective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems.

Keywords

Scheduling / heuristic / lower bound / branch-and-bound algorithm / identical parallel machines / family setup times

References

[1] Allahverdi, A., Ng, C.T., Cheng, T.C.E. & Kovalyov, M.Y. (2006). A survey of scheduling problems with setup times or costs. European Journal of Operational Research (online November 2006)

[2] Azizoglu M., Kirca O.. On the minimization of total weighted flow time with identical and uniform parallel machines. European Journal of Operational Research, 1999, 113: 91-100.

[3] Azizoglu M., Webster S.. Scheduling parallel machines to minimize flowtime with family set-up times. International Journal of Production Research, 2003, 41: 1199-1215.

[4] Belouadeh H., Potts C.N.. Scheduling identical parallel machines to minimize total weighted completion time. Discrete Applied Mathematics, 1994, 48: 201-218.

[5] Bruno J.W., Coffman E.G., Sethi R.. Scheduling independent tasks to reduce mean finishing time. AIIE Transactions, 1974, 17: 382-387.

[6] Chen Z.L., Powell W.B.. Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 1999, 11: 87-94.

[7] Dunstall S., Wirth A.. A comparaison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. European Journal of Operational Research, 2005, 167: 283-296.

[8] Dunstall S., Wirth A.. Heuristic methods for the identical parallel machine flowtime problem with set-up times. Computers & Operations Research, 2005, 32: 2479-2491.

[9] Dunstall S., Wirth A., Baker K.. Lower bounds and algorithms for flowtime minimization on a single machine with set-up times. Journal of Scheduling, 2000, 3: 51-69.

[10] Eastman W.L., Even S., Isaacs I.M.. Bounds for the optimal scheduling of n jobs on m processors. Management Science, 1964, 11: 268-279.

[11] Elmaghraby S., Park S.H.. Scheduling jobs on a number of identical machines. AIIE Transactions, 1974, 6: 1-13.

[12] Garey M.R., Johnson D.S.. ’strong’; NP-completness results: Motivation, examples and implications. Journal of the Association for Compting Machinery, 1978, 25: 499-508.

[13] Graham R.L.. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 1969, 17: 416-429.

[14] Held M., Wolfe P., Crowder H.P.. Validation of subgradient optimization. Math. Programming, 1974, 6: 62-88.

[15] Kacem I.. Lower bounds for tardiness minimization on a single machine with family setup times. International Journal of Operations Research, 2007, 4: 18-31.

[16] Mason A.J., Anderson E.J.. Minimizing flow time on a single machine with job classes and setup times. Naval Research Logistics, 1991, 38: 333-350.

[17] McNaughton R.. Scheduling with deadlines and loss functions. Management Science, 1959, 6: 1-12.

[18] Monma C.L., Potts C.N.. On the complexity of scheduling with batch setup times. Operations Research, 1989, 37: 798-804.

[19] Smith W.E.. Various optimizers for single-stage production. Naval Research Logistics, 1956, 3: 59-66.

[20] Webster S.. Weighted flow time bounds for scheduling identical processors. European Journal of Operational Research, 1995, 80: 103-111.

[21] Webster S.. The complexity of scheduling job families about common due date. Operations Research Letters, 1997, 20: 65-74.

[22] Webster S., Azizoglu M.. Dynamic programming for scheduling parallel machines with family setup times. Computers & Operations Research, 2001, 28: 127-137.