An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times

IIE Transactions (Institute of Industrial Engineers)

Volumn 35, Issue 2, 2003, Pages 183-190

  Yalaoui, Farouk ^a   Chu, Chengbin ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; EVALUATION; HEURISTIC METHODS; PARALLEL PROCESSING SYSTEMS; PERFORMANCE; PROBLEM SOLVING; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

JOB SPLITTING; PARALLEL MACHINE SCHEDULING PROBLEMS; SEQUENCE-DEPENDENT SETUP TIMES;

SCHEDULING;

EID: 0037321475     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170304382     Document Type: Article

References (31)

1. Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T. (1999) A review of scheduling research involving setup considerations. Omega: International Journal of Management Science, 27, 219-239.
2. Bellmore, M. and Malone, J.C. (1971) Pathology of traveling salesman subtour elimination algorithms. Operations Research, 19, 278-307
3. Boland, N.L., Clarke, L.W. and Nemheuser, G.L. (2000) The asymmetric traveling salesman problem with replenishment arcs. European Journal of Operational Research, 123, 408-427.
4. Carlier, J. and Villon, P. (1990) A new heuristic for traveling salesman problem. RAIRO: Recherches Opérationnelles/Operations Research, 24, 245-253.
5. Carpaneto, G., Dell'amico, M. and Toth, P. (1995) Exact solution of large-scale, asymmetric traveling problem. ACM Transactions on Mathematical Software, 21, 394-409.
6. Carpaneto, G. and Toth, P. (1980) Solution of the assignment problem, ACM Transactions on Mathematical Software, 6, 104-111.
7. Chen, B. (1993) A better heuristic for preemptive parallel machine scheduling with batch setup times, SIAM Journal of Computing, 22, 1303-1318.
8. Chen, J. and Steiner, G. (1998) Lot streaming with attached setups in three machine flow shops. IIE Transactions, 30, 1075-1084.
9. Cheng, T.C.E. and Sin, C.C.S. (1990) A state of the art review of parallel machine scheduling research. European Journal of Operational Research, 47, 271-292.
10. Coffman, E., Garey, M. and Johnson, D. (1978) An application of bin-packing to multi-processors scheduling. SIAM Journal of Computing, 7, 1-16.
11. Dauzère-Pérèse, S. and Lassere, J.-B. (1997) Lot streaming in job-shop scheduling. Operations Research, 45, 584-595.
12. Flipo-Dhaenens, C. (1998) Optimisation d'un réseau de production et de distribution. Ph.D. Thesis, Institut National Polytechnique de Grenoble, Grenoble, France.
13. Gilmore, P.C. and Gomory, R.E. (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Operations Research, 12, 655-679.
14. Guinet, A. (1993) Scheduling sequencing-dependent jobs on identical parallel machines to minimize completion criteria. International Journal of Production Research, 31, 1579-1594.
15. Hu, T.C. (1961) Parallel sequencing and assembly line problems. Operations Research, 9, 841-948.
16. Karp, R. (1979) A patching algorithm for the asymmetric traveling salesman problem. SIAM Journal of Computing, 8, 561-573.
17. Laporte, G. (1997) Modeling and solving several classes of arc routing problems as traveling salesman problems. Computers and Operations Research, 24, 1057-1061.
18. Little, J.D.C., Murty, K.G., Sweeney, D.W. and Karel, C. (1963) An algorithm for the traveling salesman problem. Operations Research, 11, 972-989.
19. Lysgaard, J. (1999) Cluster-based branching for the asymmetric traveling salesman problem. European Journal of Operational Research, 119, 314-325.
20. McNaugton, R. (1959) Scheduling with deadlines and loss functions. Management Science, 6, 1-12.
21. Miller, D. and Pekny, J.F. (1989) Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Operations Research Letters, 8, 129-135.
22. Monma, M.L. and Potts, C.N. (1993) Analysis of heuristics for preemptive parallel machine scheduling with batch setup times. Operations Research, 41, 172-189.
23. Ovacik, I.M. and Uzsoy, R. (1993) Worst-case error bounds for parallel machines scheduling problems with sequence dependent setup times. Operations Research Letters, 14, 251-256.
24. Philips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C. and Wein, J. (1998) Improved bounds on relaxation of a parallel machine scheduling problem. Journal of Combinatorial Optimization, 1, 413-426.
25. Rajgopal, J. and Bidanda, B. (1991) On scheduling parallel machines with two setup classes. International Journal of Production Research, 29, 2443-2458.
26. Sen, A., Topaloglu, E. and Benli, O.S. (1998) Optimal streaming of a single job in a two stage flow shop. European Journal of Operational Research, 110, 42-62.
27. Serafini, P. (1996) Scheduling jobs on several machines with the job splitting property. Operations Research, 44, 617-628.
28. Smith, T.H.C., Srinivasan, V. and Thompson, G.L. (1977) Computational performance of three subtour elimination algorithms for the solving asymmetric traveling salesman problem. Annals of Discrete Mathematics, 1, 495-506.
29. So, K.C. (1990) Some heuristics for scheduling jobs on parallel machines with setups. Management Science, 36, 467-476.
30. Sriskandarajah, C. and Wagneur, E. (1999) Lot streaming and scheduling multiple products in two-machine no-wait flowshops. IIE Transactions, 31, 695-707.
31. Tang, C. (1990) Scheduling batches on parallel machines with major and minor setups. European Journal of Operational Research, 46, 28-37.