Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 2

International Journal of Production Research

Volumn 35, Issue 1, 1997, Pages 101-122

  Sharadapriyadarshini, B ^a   Rajendran, C ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; PERTURBATION TECHNIQUES; SCHEDULING; STRATEGIC PLANNING;

BUFFER STORAGE CAPACITY; FLOWLINE BASED MANUFACTURING; IDLE TIME; MULTIPLE RANDOM INSERTION TECHNIQUE; PERMUTATION FLOWSHOP;

PRODUCTION CONTROL;

EID: 0030737841     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075497196000     Document Type: Article

References (18)

1. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
2. Berkley, B. J., 1992, A review of kanban production control research literature. Production and Operations Management, 1, 393-411.
3. Campbell, H. G., Dudek, R. A., and Smith, M. L., 1970, A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science, 16, B630-B637.
4. Dannenbring, D. G., 1977, An evaluation of flowshop sequencing heuristics. Management Science, 23, 1174-1182.
5. French, S., 1982, Sequencing and Scheduling: An Introduction to the Mathematics of the Jobshop. (Chichester, UK: Ellis Horwood).
6. Gelders, F. L., and Sambandam, N., 1978, Four simple heuristics for scheduling a flowshop. International Journal of Production Research, 16, 221-231.
7. Ho, J. C., and Chang, Y. L., 1991, A new heuristic for then-job, m-machine flowshop problem. European Journal of Operational Research, 52, 194-202.
8. Ignall, E., and Schrage, L., 1965, Application of the branch and bound technique to some flowship scheduling problems. Operations Research, 13, 400-412.
9. Johnson, S. M., 1954, Optimal two- and three-stage production schedules. Naval Research Logistics Quarterly, 1, 61-68.
10. Leisten, R., 1990, Flowshop sequencing problems with limited buffer storage. International Journal of Production Research, 28, 2085-2100.
11. Miyazaki, S., and Nishiyama, N., 1980, Analysis for minimizing weighted mean flow-time in flow-shop scheduling. Journal of the Operations Research Society of Japan, 23, 118-132.
12. Miyazaki, S., Nishiyama, N., and Hashimoto, F., 1978, An adjacent pairwise approach to the mean flow-time scheduling problem. Journal of the Operations Research Society of Japan, 21, 287-299.
13. Nawaz, M., Enscore, E. E., and Ham, I., 1983, A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega, 11, 91-95.
14. max flowshop problem. Computers and Operations Research, 17, 243-253.
15. Rajendran, C., 1993, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics, 29, 65-73.
16. Rajendran, C., and Chaudhuri, D., 1991, A flowshop scheduling algorithm to minimize total flowtime. Journal of the Operations Research Society of Japan, 34, 28-46.
17. Sridhar, j., and Rajendran, C., 1993, Scheduling in a cellular manufacturing system-a simulated annealing approach. International Journal of Production Research, 31, 2927-2945.
18. Widmer, M., and Hertz, A., 1989, A new heuristic method for the flowshop sequencing problem. European Journal of Operational Research, 41, 186-193.