Heuristic dispatching rule to maximize TDD and IDD performance

International Journal of Production Research

Volumn 42, Issue 24, 2004, Pages 5133-5147

  Ho, T F ^a   Li, R K ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; SOCIETIES AND INSTITUTIONS;

DISPATCHING RULES; HEURISTIC DISPATCHING RULE; INVENTORY DOLLAR-DAY (IDD); THROUGHPUT DOLLAR-DAY (TDD);

COSTS;

EID: 10444234309     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/0020754042000270421     Document Type: Article

References (12)

1. BEDWORTH, D. D. and BAILEY, J., 1987, Integrated Production Control Systems. Management, Analysis, Design, 2nd edn (New York: Wiley), pp. 255-260.
2. GOLDRATT, E. M., 2000, Essays On the Theory of Constraints (North River, Great Barrington, MA).
3. HOLSENBACK, J. E., RUSSELL, R. M., MARKLAND, R. E. and PHILIPOOM, P. R., 1999, An improved heuristic for the single-machine, weighted-tardiness problem. Omega, Int. J. Mgmt, 27, 485-495.
4. LIAW, C. F., 1999, A branch-and-bound algorithm for the single machine earliness and tardiness-scheduling problem. Comput. Oper. Res., 26, 679-693.
5. PHILIPOOM, P. R., 2000, The choice of dispatching rules in a shop using internally set due-dates with quoted lead time and tardiness costs. Int. J. Prod. Res., 38, 1641-1655.
6. PINEDO, M., 2002, Scheduling Theory, Algorithm, and System, 2nd edn (Upper Saddle River: Prentice-Hall), pp. 53-54, 335-342.
7. RAJENDRAN, C. and ZIEGLER, H., 1997a, An efficient heuristic for scheduling in a flow shop to minimize total weighted flow time of jobs. Eur. J. Oper. Res., 103, 129-138.
8. RAJENDRAN, C. and ZIEGLER, H., 1997b, A heuristic for scheduling to minimize the sum of weighted flow time of jobs in a flow shop with sequence-dependent setup times of jobs. Comput. Ind. Eng., 33, 281-284.
9. RAJENDRAN, C. and ZIEGLER, H., 1999, Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flow time and weighted tardiness of jobs. Comput. Ind. Eng., 37, 671-690.
10. TSAI, C. H., CHANG, G. T. and Li, R. K., 1997, Integrating order release control with due-date assignment rules. Int. J. Prod. Res., 35, 3379-3392.
11. TSENG, T. Y., Ho, T. F. and Li, R. K., 1999, Mixing macro and micro flow time estimation model: wafer fab example. Int. J. Prod. Res., 37, 2447-2461.
12. VOLGENANT, A. and TEERHUIS, E., 1999, Improved heuristics for the n-job single-machine weighted tardiness problem. Comput. Oper. Res., 26, 35-44.