Citations (20)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (9)
Ren Genquan, Han Rui, Liu Yingbo, Zhao Jiong, Jin Tao, Zhang Li & Wang Jianmin. (2013) Applying genetic algorithm to optimise personal worklist management in workflow systems. International Journal of Production Research 51:17, pages 5158-5179.
Read now
Read now
Nasser Mebarki & Atif Shahzad. (2013) Correlation among tardiness-based measures for scheduling using priority dispatching rules. International Journal of Production Research 51:12, pages 3688-3697.
Read now
Read now
Choonjong Kwak & Chang Ouk Kim. (2009) A multicriteria approach to timeout collaboration protocol. International Journal of Production Research 47:22, pages 6417-6432.
Read now
Read now
PeiChann Chang & Ling-Huey Su. (1999) 動態零工工廠主動反應式排程修正法則之發展. Journal of the Chinese Institute of Industrial Engineers 16:3, pages 345-352.
Read now
Read now
AVINASHM. WAIKAR, BHABAR. SARKER & ANILM. LAL. (1995) A comparative study of some priority dispatching rules under different shop loads. Production Planning & Control 6:4, pages 301-310.
Read now
Read now
K. ITOH, D. HUANG & T. ENKAWA. (1993) Twofold look-ahead search for multi-criterion job shop scheduling. International Journal of Production Research 31:9, pages 2215-2234.
Read now
Read now
MING-HUA YE & GLYNB. WILLIAMS. (1991) An expediting heuristic for the shortest processing time dispatching rule. International Journal of Production Research 29:1, pages 209-213.
Read now
Read now
E. J. ANDERSON & J. C. NYIRENDA. (1990) Two new rules to minimize tardiness in a job shop. International Journal of Production Research 28:12, pages 2277-2292.
Read now
Read now
STEFKAP. STOEVA. (1990) A due date-based dispatching rule for flexible manufacturing systems. International Journal of Production Research 28:11, pages 1991-1999.
Read now
Read now
Articles from other publishers (11)
Syed Abou Iltaf Hussain, Ranbir Kalita & Uttam Kumar Mandal. (2023) A priority-based heuristic approach for solving flexible flow-shop with parallel machine scheduling in a fuzzy environment. Granular Computing 8:6, pages 1097-1120.
Crossref
Crossref
Mingze Yuan, Lin Ma, Ting Qu & Matthias Thürer. (2023) Shop floor dispatching with variable urgent operations based on Workload Control: An assessment by simulation. IET Collaborative Intelligent Manufacturing 5:3.
Crossref
Crossref
Klaus Altendorfer & Herbert Jodlbauer. (2011) Which utilization and service level lead to the maximum EVA?. International Journal of Production Economics 130:1, pages 16-26.
Crossref
Crossref
Atif Shahzad & Nasser Mebarki. (2009) A Study of Tardiness Based Measures for Benchmark Priority Dispatching Rules used in Dynamic Job Shop. IFAC Proceedings Volumes 42:4, pages 1983-1988.
Crossref
Crossref
Nasser Mebarki & Atif Shahzad. (2008) A procedure to compute a probabilistic bound for the maximum tardiness using stochastic simulation. IFAC Proceedings Volumes 41:2, pages 10534-10539.
Crossref
Crossref
I Sabuncuoglu & A Comlekci. (2002) Operation-based flowtime estimation in a dynamic job shop. Omega 30:6, pages 423-442.
Crossref
Crossref
Sebastian Engell, Frank Herrmann & Manfred Moser. 1994. Computer control of flexible manufacturing systems. Computer control of flexible manufacturing systems
75
107
.
Spyros Tzafestas & Alekos Triantafyllakis. (1993) Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms. Mathematics and Computers in Simulation 35:5, pages 397-434.
Crossref
Crossref
Andrew Kusiak & Jaekyoung Ahn. (1992) Intelligent scheduling of automated machining systems. Computer Integrated Manufacturing Systems 5:1, pages 3-14.
Crossref
Crossref
M. Moser & S. Engell. (1992) Comprehensive Evaluation Of Paority Rules For On-line Scheduling: The Single Machine Case. Comprehensive Evaluation Of Paority Rules For On-line Scheduling: The Single Machine Case.
M. Moser & S. Engell. (1992) A survey of priority rules for FMS scheduling and their performance for the benchmark problem. A survey of priority rules for FMS scheduling and their performance for the benchmark problem.