A methodology for schedule compression

Production Planning and Control

Volumn 7, Issue 4, 1996, Pages 407-417

  Huei Wu, Horng ^a   Kwei Li, Rong ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Leitstand; Schedule; Schedule compression; Schedule graph

Indexed keywords

ALGORITHMS; CALCULATIONS; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; OPERATIONS RESEARCH; PERFORMANCE; SCHEDULING;

DISPATCHING RULES; PRIORITY WEIGHT COMPUTATION; SCHEDULE COMPRESSION; SCHEDULE GRAPH;

PRODUCTION CONTROL;

EID: 0030194864     PISSN: 09537287     EISSN: 13665871     Source Type: Journal    
DOI: 10.1080/09537289608930369     Document Type: Article

References (17)

1. BALI. M., and MAGAZINE, M., 1981, The design and analysis of heuristics, Networks, 11, 215-219.
2. BIACKSTONE, J. H., PHILLIPS, D. T., AND HOGG, G. L., 1982, A STATE-OF-THE-ART SURVEY OF DISPATCHING RULES FOR MANUFACTURING JOB SHOP OPERATIONS. International Journal of Production Research, 20, 27-45. ’
3. CHANDRA, J., and TALAVAGE.J., 1991, Intelligent dispatching for flexible manufacturing. InternationalJournal of Production Research, 29, 2259-2278.
4. GASCON, A., and LEACHMAN, R. C., 1988, Adynamic programming solution to the dynamic, multi-item, single-machine scheduling problem. Operations Research, 36, 50-56.
5. GOLDRATI. E. M., 1990, The Haystack Syndrome (North River Press, Croton-on-Hudson, New York).
6. HUTCHISON, J., 1989, Scheduling in random job shop type flexible manufacturing systems. PhD Dissertation, College of Business, University of Houston.
7. HUTCHISON, J., LEONG, K., SNYDER, D., and WARD, P., 1991, Scheduling approaches for random job shop flexible manufacturing systems. International Journal of Production Research, 29, 1053-1067.
8. LIU, J. J., 1990, Optimal dispatching in a periodic review cellular manufacturing system. Operation Research, 38, 893-901.
9. MULLER-MERBACH, H., 1981, Heuristics and their design: a survey. European Journal of Operational Research, 8, 1-23.
10. NORONHA, S. J., and SARMA, V. V. S., 1991, Knowledge-based approaches for scheduling problems: a survey. IEEE Transactions on Knowledge and Data Engineering, 3, 160-171.
11. PEARL, J., 1984, Heuristics: Intelligent Search Strategies for Computer Problem solving (Addision-Wesley, Cambridge, MA).
12. PROUST, C., Gurr A, J. N. D., and DESCHAMPS, V., 1991, Flowshop scheduling with setup, processing andremoval times separated. International Journal of Production Research, 29, 479-493.
13. SCHRAGENHEIM, E., and RONEN, B., 1990, Drum-buffer-ropeshop floor control. Production and Inventory Management Journal, 31, 18-22.
14. SCHRAGENHEIM, E., and Ronen, B., 1991, Buffer management: a diagnostic tool Tor production control. Production and Inventory Management Journal, 32, 74-79.
15. SHAW, M. J., 1988, A pattern-directed approach to FMS scheduling.Annals of Operations Research, 15, 353-376.
16. VANDE VELDE, S. L., 1990, Minimizing the sum of the job completion times in the two-machine flow shopby Lagrangian relaxation. Annals of Operations Research, 26, 257-268.
17. Wu, H.-H., and Li, R.K., 1994, A new rescheduling method for computer-based schedule systems. International Journal of Production Research (accepted).