Bottleneck-based heuristic dispatching rule for optimizing mixed TDD/IDD performance in various factories

International Journal of Advanced Manufacturing Technology

Volumn 36, Issue 7-8, 2008, Pages 773-779

  Ho, Tseng Fung ^a   Li, Rong Kwei ^b  

^a HSIUPING INSTITUTE OF TECHNOLOGY   (Taiwan)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Dispatching; Heuristic; IDD; Performance; Scheduling; TDD

Indexed keywords

CONSTRAINT THEORY; INDUSTRIAL PLANTS; TIME DIVISION MULTIPLEXING;

CYCLE TIME; DISPATCHING; DISPATCHING RULES; DUE DATES; EARLIEST-DUE-DATE; FINANCIAL FACTORS; FINANCIAL IMPACTS; HEURISTIC; IDD; INCREASING PRODUCTION; MATERIAL COSTS; MAXIMUM TARDINESS; MEAN FLOW TIME; PERFORMANCE; SCHEDULING; SCHEDULING PROBLEMS; SHORTEST PROCESSING TIME; TDD; Z VALUE;

LAWS AND LEGISLATION;

EID: 51849148976     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-006-0875-x     Document Type: Article

References (12)

1. Bedworth DD, Bailey JE (1987) Integrated production control systems: management, analysis and design, 2nd edn. Wiley, New York
2. Tseng T-Y, Ho T-F, Li R-K (1999) Mixing macro and micro flow time estimation model: wafer fab example. Int J Prod Res 37(11):2447-2461
3. Philipoom PR (2000) The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs. Int J Prod Res 38(7):1641-1655
4. Goldratt EM (2000) Essays on the theory of constraints. North River Press, Great Barrington, Massachusetts
5. Rajendran C, Ziegler H (1999) Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs. Comput Ind Eng 37(4):671-690
6. Rajendran C, Ziegler H (1997) An efficient heuristic for scheduling in a flow shop to minimize total weighted flow time of jobs. Eur J Oper Res 103(1):129-138
7. Holsenback JE, Russell RM, Markland RE, Philipoom PR (1999) An improved heuristic for the single-machine, weighted-tardiness problem. Omega Int J Manage Sci 27(4):485-495
8. Pinedo M (2002) Scheduling theory, algorithm, and system, 2nd edn. Prentice Hall, Englewood Cliffs, New Jersey
9. Volgenant A, Teerhuis E (1999) Improved heuristics for the n-job single-machine weighted tardiness problem. Comput Ops Res 26(1):35-44
10. Kutanoglu E, Sabuncuoglu I (1997) An analysis of heuristics in a dynamic job shops with weighted tardiness objectives. Int J Prod Res 37(1):165-187
11. Barman S (1997) Simple priority rule combinations: an approach to improve both flow time and tardiness. Int J Prod Res 35(10):2857-2870
12. Ho TF, Li RK (2004) Heuristic dispatching rule to maximize TDD and IDD performance. Int J Prod Res 42(24):5133-5147