A milp model for the n-job, m-stage flowshop with sequence dependent set-up times

International Journal of Production Research

Volumn 24, Issue 6, 1986, Pages 1459-1474

  Srikar, Bellur N ^a   Ghosh, Soumen ^b  

^a AMR   (United States)

^b MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

JOB ANALYSIS - MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING, LINEAR;

FLOWSHOP PROBLEMS; MIXED INTEGER LINEAR PROGRAM (MILP);

PRODUCTION CONTROL;

EID: 0022806444     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207548608919815     Document Type: Article

References (33)

1. Baksk, K R., 1974, Introduction to Sequencing and Scheduling (New York John Wiley and Sons)
2. Bansal, S. P., 1977, Minimizing the sum of completion times of n jobs over m machines in * flow«hop—a branch and bound approach. A.I.I.E. Transactions. 9, 306
3. Barnes, J. W., and Vanston, L. K., 1981, Scheduling jobs with linear delay penalties and sequence dependent setup costs. Operations Research. 29, 146
4. Bbixmorb, M., and Xemiikuser, G. I., 1968, The travelling salesman problem a survey. Operations Research, 16, 538
5. Bellman, R., 1962, Dynamic programming treatment of the travelling salesman problem. Journal of the Association of Computing Machinery, 9, 61
6. Benton, W. C., and Shikar, B., 1982, Evaluating tin efficient heuristic for the multiple vehicle problem. Working Paper Series 82-72, C.A.S., Ohio State University, U.S.A
7. Bulkin, H. L., and Parker, R. G., 1976. On a two facility scheduling problem with sequence dependent processing time. A.I.I.E. Transaction.?, 8, 202.
8. Clark, G., and Wrioht, I., 1964, Scheduling vehicles from a central depot to a number of delivery points. Operations Research, 12, 568.
9. Daniels, V., 1983. Lot sizing and sequencing problems in processing industries. Unpublished dissertation, The Ohio State University. U.S. A
10. Dantzic, G., and Ramser, J. 1959. The truck dispatching problem. Ma7iagt.mf.nt Science, 6, 80
11. Dbanb, R. H. and Whitb, E. R. 1975. Balancing workloads and minimizing setup costs in the parallel processing shop. Operational Research Quarterly, 26, 45
12. Driscoll, W. C., and Emmons, H., 1977. Scheduling production on one machine with changeover costs. A.I.I.E. Transactions, 9, 388
13. Gavett, J. W., 1965, Three heuristic rules for sequencing jobs to a single production facility. Management Science, 11, B-166
14. Gkokkrion, A. M. and Graves, G. W., 1976, Scheduling parallel production lines with changeover costs: practical application of a quadratic assignment/LP approach. Operations Research. 24. 595.
15. Gurta, J N. D., 1969, A general algorithm for the n x M scheduling problem. International Journal of Production Research. 7, 241
16. Gupta, J. N. D. 1977, A review of fiowshop scheduling research in LP. Ritzman et al. (editors), Disaggregation Problems in Manufacturing and Service Organization (The Hague: Martinus Nijhoff).
17. Gupta, S. K., 1982. jobs and m machines job-shop problems with sequence-dependent set-up times, International Journal of Production Research. 20, 643
18. Hill, A. V., 1980. Mixed-integer programming formulations for the travelling salesman and vehicle Scheduling problems. Working papers 52. Graduate School of Business Administration, University of Minnesota. U S A
19. Johnson, S. M., 1954. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly,1, 61.
20. Little, J. D. O., Murthv, V. G., Sweeny, D. W., and Karel, C., 1963, An algorithm for ‘the travelling salesman problem, Operations Research, 11, 972.
21. Lockktt, A. G. and Muiilemann, A. P., 1972, A scheduling problem involving sequence dependent changeover times. Operations Research, 20, 895.
22. Miller, C. E., Tucker, A. W., and Zernlin, R. A., 1960, Integer programming formulation of t ravelling salesman problem. Journal of the Association of Computing Machinery. 7, 326
23. Moore, J. R., 1975. An algorithm for a single machine scheduling problem with sequence dependent setup times and scheduling windows A.I.I.E. Transactions, 7, 35
24. Pahker, R. G-, Dkane, R. H., and Holmes, R. A. 1977, On the use of a vehicle routing algorithm for the parallel processor problem with sequence, dependent changeover costs. A.I.I.E. Transactions. 9, 155
25. Prabiukar, T., 1974, A production scheduling problem with sequencing considerations. Management Science. 21, 34
26. Sawicki, J. D-, 1973, The problems of tardiness and saturation in a multi-class queue with sequence-dependent setups. A.I.I.E. Transactions, 5, 250
27. Sciconiclvm (1983) Version 1.2, Scicon Computer Services Limited, Txmdon.
28. Sielkbn, R. L., 1976, Sequencing with setup costa by zero-one mixed integer linear programming A I IE. Transactions, 8, 369
29. Srikar, B. N., Daniels, V., and Rctsman, L. P., 1983, Multistage-multicycle fiowshop sequencing. Working paper. Series 83-81, C A.S., Ohio State University, U S-A.
30. SVKSTXA, J., and Huckkelut, V. E. 1970, Computational experience with an M-salesman problem. Management Science, 19, 790
31. Taha, H A, 1971, Sequencing by implicit ranking and zero-one polynomial programming. A.I.I.E. Trasartions, 3, 299
32. Uskup, G., and Smith, S B. 1975. A branch and bound for two-stage production sequencing problems Operations Research. 23, 118
33. White, C. H., and Wilson, R. C., 1977, Sequence dependent set-up times and job sequencing. International Journal of Production Research, 16, 191