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

Journal of Systems Science and Systems Engineering

Volumn 17, Issue 4, 2008, Pages 446-459

  Bettayeb, Belgacem ^a   Kacem, Imed ^a   Adjallah, Kondo H ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Branch and bound algorithm; Family setup times; Heuristic; Identical parallel machines; Lower bound; Scheduling

Indexed keywords

ALGORITHMS; BUSINESS MACHINES; CONTROL THEORY; HEURISTIC METHODS; PARALLEL ALGORITHMS; SCHEDULING; SCHEDULING ALGORITHMS;

BRANCH-AND-BOUND ALGORITHM; FAMILY SETUP TIMES; HEURISTIC; IDENTICAL PARALLEL MACHINES; LOWER BOUND;

HEURISTIC ALGORITHMS;

EID: 57649244161     PISSN: 10043756     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11518-008-5065-y     Document Type: Article

References (22)

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. M. Azizoglu O. Kirca 1999 On the minimization of total weighted flow time with identical and uniform parallel machines European Journal of Operational Research 113 91 100
3. M. Azizoglu S. Webster 2003 Scheduling parallel machines to minimize flowtime with family set-up times International Journal of Production Research 41 1199 1215
4. H. Belouadeh C.N. Potts 1994 Scheduling identical parallel machines to minimize total weighted completion time Discrete Applied Mathematics 48 201 218
5. J.W. Bruno E.G. Coffman R. Sethi 1974 Scheduling independent tasks to reduce mean finishing time AIIE Transactions 17 382 387
6. Z.L. Chen W.B. Powell 1999 Solving parallel machine scheduling problems by column generation INFORMS Journal on Computing 11 87 94
7. S. Dunstall A. Wirth 2005 A comparaison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines European Journal of Operational Research 167 283 296
8. S. Dunstall A. Wirth 2005 Heuristic methods for the identical parallel machine flowtime problem with set-up times Computers & Operations Research 32 2479 2491
9. S. Dunstall A. Wirth K. Baker 2000 Lower bounds and algorithms for flowtime minimization on a single machine with set-up times Journal of Scheduling 3 51 69
10. W.L. Eastman S. Even I.M. Isaacs 1964 Bounds for the optimal scheduling of n jobs on m processors Management Science 11 268 279
11. S. Elmaghraby S.H. Park 1974 Scheduling jobs on a number of identical machines AIIE Transactions 6 1 13
12. M.R. Garey D.S. Johnson 1978 'strong'; NP-completness results: Motivation, examples and implications Journal of the Association for Compting Machinery 25 499 508
13. R.L. Graham 1969 Bounds on multiprocessing timing anomalies SIAM Journal on Applied Mathematics 17 416 429
14. M. Held P. Wolfe H.P. Crowder 1974 Validation of subgradient optimization Math. Programming 6 62 88
15. I. Kacem 2007 Lower bounds for tardiness minimization on a single machine with family setup times International Journal of Operations Research 4 18 31
16. A.J. Mason E.J. Anderson 1991 Minimizing flow time on a single machine with job classes and setup times Naval Research Logistics 38 333 350
17. R. McNaughton 1959 Scheduling with deadlines and loss functions Management Science 6 1 12
18. C.L. Monma C.N. Potts 1989 On the complexity of scheduling with batch setup times Operations Research 37 798 804
19. W.E. Smith 1956 Various optimizers for single-stage production Naval Research Logistics 3 59 66
20. S. Webster 1995 Weighted flow time bounds for scheduling identical processors European Journal of Operational Research 80 103 111
21. S. Webster 1997 The complexity of scheduling job families about common due date Operations Research Letters 20 65 74
22. S. Webster M. Azizoglu 2001 Dynamic programming for scheduling parallel machines with family setup times Computers & Operations Research 28 127 137