An exact method for Pm / sds, ri / ∑i = 1n Ci problem

Computers and Operations Research

Volumn 34, Issue 9, 2007, Pages 2840-2848

  Nessah, Rabia ^a   Chu, Chengbin ^a   Yalaoui, Farouk ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Dominance properties; Heuristic; Identical parallel machine; Lower bound; Release dates; Scheduling; Setup time

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION CONTROL; SCHEDULING; THEOREM PROVING;

DOMINANCE PROPERTIES; IDENTICAL PARALLEL MACHINES; RELEASE DATES; SETUP TIME;

RESOURCE ALLOCATION;

EID: 33846567126     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.10.017     Document Type: Article

References (26)

1. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
2. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin P, editors. Handbooks in operations research and management science, vol. 4: logistics of production and inventory. Amsterdam: North-Holland; 1993.
3. Frederickson GN, Hecht MS, Kim CE. Approximation algorithms for some routing problems. SIAM Journal on Computing 1978. p. 178-93.
4. França P.M., Gendreau M., Laporte G., and Müller F.M. A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. International Journal of Production Economics 43 (1996) 79-89
5. Gendreau M., Laporte G., and Guimarães E.M. A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. European Journal of Operational Research 133 (2001) 183-189
6. Brucker P., and Thiele O. A branch and bound method for the general-shop problem with sequence dependent setup-times. OR Spectrum 18 (1996) 145-161
7. Baptiste P., and Le Pape C. Scheduling a single machine to minimize a regular objective function under setup constraints. Discrete Optimization 2 (2005) 83-99
8. Yalaoui F., and Chu C. An efficient heuristic approach for parallel machine scheduling with job splitting and sequence dependent setup times. IIE Transactions 35 2 (2003) 183-190
9. Chen Z.L., and Powell W.B. Exact algorithms for scheduling multiple families of jobs on parallel machines. Naval Research Logistics 50 (2003) 823-840
10. Allahverdi A., and Aldowaisan T. Minimizing mean flowtime in a two-machine flowshop with sequence independent setup times. Computers & Operations Research 27 (2000) 111-127
11. Allahverdi A., and Aldowaisan T. Two-machine flowshop scheduling to minimize total completion time with separate setup and removal times. International Journal of Industrial Engineering 9 3 (2002) 275-286
12. Rajendran C., and Ziegler H. Scheduling to minimize the sum of weighted fowtime and weighted tardiness of jobs in a fowshop with sequence-dependent setup times. European Journal of Operational Research 149 (2003) 513-522
13. Du J., Leung J.Y.-T., and Young G.H. Scheduling chain structured tasks to minimize makespan and mean flowtime. Information and Computing 92 (1991) 219-236
14. i schedule problem. International Journal of Production Economics 2006; 100(1): 168-79.
15. Belouadah H., and Potts C.N. Scheduling of a single machine to minimize total weighted completion time. Discrete Applied Mathematics 48 (1994) 201-218
16. Elmaghraby S.E., and Park S.H. Scheduling jobs on a number of identical machines. AIIE Transactions 6 (1974) 1-13
17. Azizoglu M., and Kirca O. On the minimization of total weighted flow time with identical and uniform parallel machines. European Journal of Operational Research 113 (1999) 91-100
18. Barnes J.W., and Brennan J.J. An improved algorithm for scheduling jobs on identical machines. AIIE Transactions 9 (1977) 23-31
19. Serin S.C., Ahn S., and Bishop A.B. An improved branching scheme for the branch and bound procedure of scheduling n jobs on m machines to minimize total weighted flow time. International Journal of Production Research 26 (1988) 1183-1191
20. Baptiste P. A note on scheduling multiprocessor tasks with identical processing times. Computers & Operations Research 30 (2003) 2071-2078
21. Azizoglu M. Preemptive scheduling on identical parallel machines subjects to deadlines. European Journal of Operational Research 148 (2003) 205-210
22. Leonardi S, Raz D. Approximation total flow time on parallel machines. In: Proceedings of the 29th annual ACM symposium on the theory of computing. 1997. p. 110-9.
23. Phillips CA, Stein C, Wein J. Scheduling jobs that arrive over time. In: Proceedings of the fourth workshop on algorithm and data structures. Lecture notes in computer science, vol. 95. 1995. p. 86-97.
24. Phillips C.A., Schulz A.S., Shmoys D.B., Stein C., and Wein J. Improved bounds on relaxations of a parallel machine scheduling problem. Journal of Combinatorial Optimization 1 (1998) 413-426
25. Chu C. A branch and bound algorithm to minimize total tardiness with different release dates. Naval Research Logistics 39 (1992) 265-283
26. Schutten J.M.J. List scheduling revisited. Operations Research Letters 18 (1996) 167-170