A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates

International Journal of Production Research

Volumn 36, Issue 8, 1998, Pages 2269-2283

  Sonmez, A I ^a   Baykasoglu, A ^a  

^a GAZIANTEP UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; JOB ANALYSIS; OPTIMIZATION; PLASTIC PIPE; SCHEDULING;

FLOWSHOP SEQUENCING PROBLEMS; MULTISTAGE PRODUCTION;

PRODUCTION CONTROL;

EID: 0032142741     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075498192896     Document Type: Article

References (10)

1. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
2. Chang, Y.-L., and Sullivan, R. S., 1991, QSOM; Quantitative Systems for Operations Management Version 2 (Englewood Cliffs, NJ: Prentice Hall).
3. Kusiak K et al., 1987, Modelling and solving the flexible forging module scheduling problem. Engineering Optimization, 12, 1-12.
4. Ozden, M., Egbelu P. J., and Iyer, A. V., 1985, Job scheduling in a group technology environment for a single facility. Computers and Industrial Engineering, 9, 67-72.
5. Rothblum, U. G., 1983, A dynamic programming formulation of a production sequencing problem. Computers and Industrial Engineering, 7, 69-75.
6. Salen S et al., 1987, A mixed integer goal programming formulation of the standard flow-shop scheduling problem. Journal of the Operations Research Society, 37, 1121-1128.
7. Shanthikumar, J. G., 1983, Scheduling n jobs on one machine to minimize the maximum tardiness. Computers and Operations Research, 10, 255-260.
8. TSE, 1970, Turk Standartlary (TS 201, UDK 621.693-29:678.743.22 Ankara, Turkey).
9. Vachajitpan, P., 1983, A computer program for solving job sequencing problems. Computers and Industrial Engineering, 7, 173-185.
10. Yang, T., He, Z., and Cho, K. K., 1986, An effective heuristic method for generalized job shop scheduling with due dates. Computers and Industrial Engineering, 26, 647-660.