A study of integer programming formulations for scheduling problems

International Journal of Systems Science

Volumn 28, Issue 1, 1997, Pages 33-41

  Pan, Chao Hsien ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; MACHINERY; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING;

FLOW SHOP; JOB SHOP; MANNE MODEL; PERMUTATION FLOW SHOP SCHEDULING;

INTEGER PROGRAMMING;

EID: 0030780314     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/00207729708929360     Document Type: Article

References (29)

1. Applegate, D., and Cook, W. 1991, A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3, 149-156.
2. Ashour, S., 1970, An experimental investigation and comparative evaluation of (lowshop scheduling techniques). Operations Research, 18, 541-548.
3. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley)
4. Baker, K. R., 1975, A comparative study of flow-shop algorithms. Operations Research, 23, 62-73.
5. Baker, K. R., and Martin, J. B, 1974, An experimental comparison of solution algorithms for the single-machine tardiness problem. Naval Research Logistics Quarterly, 21, 187-199.
6. Blazewicz, J., Dror, M., and Weglarz J 1991, Mathematical programming formulations for machine scheduling: a survey. European Journal of Operations Research, 51, 283-300.
7. Bowman E. H., 1959, The scheduling-sequence problem. Operations Research, 7, 621-624.
8. Cheng T. C. E. and Gupta, M. C., 1989, Survey of scheduling research involving due date determination decisions. European Journal of Operations Research, 38, 156-166.
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 Operations Research, 47, 271-292.
10. Conway, R. W., Maxwell, W. L., and Miller, L. W., 1967, Theory of Scheduling (Reading, Massachusetts, U.S.A.: Addison-Wesley)
11. Crowder, H., Johnson, E. L., and Padberg, M., 1983, Solving large-scale zero-one linear programming problems. Operations Research, 31, 803-834.
12. French, S., 1982, Sequencing and Scheduling ', An introduction to the Mathematics of the Job-Shop (Chichester, U.K.: Ellis Horwood).
13. Graham R. L., Lawler E. L, Lenstra, J. K., and Rinnooy Kan, A. H. G., 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey. Annais of Discrete Mathematics, 5, 287-326.
14. Gravis S. C., 1981, A review of production scheduling. Operations Research. 29, 646-676.
15. Lawler, E. L., Lenstra, J. K., and Rinnooy Kan, A. H. G., 1982, Recent developments in deterministic sequencing and scheduling: a survey. In Deterministic and Stochastic Scheduling, edited by M. A. H. Dampstcr, J. K. Lenstra, and A, H. G. Rinnooy Kan (Dordrecht, The Netherlands: Reidel), pp. 35-74.
16. Liao C. L., 1993, Minimizing the number of machine idle intervals with minimum makespan in a flowshop. Journal of Operational Research Society, 44, 817-824.
17. Liao, C. L., and You, C. T., 1992, An improved formulation for the job-shop scheduling problem. Journal of Operational Research Society, 43, 1047-1954.
18. Liao, C. L., Sun, C. L, and You, W. C, 1995, Flow-shop scheduling wilh flexible processors. Computers and Operations Research, 22, 297-306.
19. Mann E A. S., 1960, On the job-shop scheduling problem. Operations Research, 8, 219-223
20. Morten, T. E., and Pentico, D. W., 1993, Heuristic Scheduling Systems (New York: Wiley).
21. Panwalkar, S. S., and Iskander, W., 1977, A survey of scheduling rules. Operations Research, 25, 45-61.
22. Ravindran, A., Phillips, D. T., and Solberg, J. J., 1987, Operations Research: Principles and Practice, second edition (New York: Wiley).
23. Rinnooy Kan, A. H. G., 1976, Machine Scheduling Problem; Classification, Complexity and Compulations (The Hague, Holland: Martinus NijhofT).
24. Rodammer, F. A., and White, K. P., 1988, A recent survey of production scheduling. IEEE Transactions on Systems, Man and Cybernetics, 18, 841-851.
25. Selen, W. J., and Hott, D. D., 1988, A mixed-integer goal-programming formulation of the standard flow-shop scheduling problem. Journal of Operational Research Society, 37, 1121-1128.
26. Stafford, E. F., 1988, On the development of a mixed-integer linear programming model for the flowshop sequencing problem. Journal of Operational Research Society, 39, 1163-1174.
27. Van Roy, T. J., and Wolsey, L. A., 1987, Solving mixed integer programming problems using automatic reformulation. Operations Research, 35, 45-57.
28. Wagner, H. M., 1959, An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly, 6, 131-140.
29. Wilson, J. M., 1989, Alternative formulations of a flow-shop scheduling problem. Journal of Operational Research Society, 40, 395-399.