781
Views
32
CrossRef citations to date
0
Altmetric
Articles

Ranking dispatching rules in multi-objective dynamic flow shop scheduling: a multi-faceted perspective

ORCID Icon &
Pages 388-411 | Received 08 Jul 2018, Accepted 18 Nov 2019, Published online: 29 Nov 2019

References

  • Aghezzaf, E. H., and H. Van Landeghem. 2002. “An Integrated Model for Inventory and Production Planning in a Two-Stage Hybrid Production System.” International Journal of Production Research 40 (17): 4323–4339. doi: 10.1080/00207540210159617
  • Ali, A. I., and L. M. Seiford. 1990. “Translation Invariance in Data Envelopment Analysis.” Operations Research Letters 9 (6): 403–405. doi: 10.1016/0167-6377(90)90061-9
  • Amin, G. R., and A. Oukil. 2019. “Gangless Cross-Evaluation in DEA: an Application to Stock Selection.” RAIRO-Operations Research 53 (2): 645–655. doi: 10.1051/ro/2018060
  • Baker, K. R. 1974. Introduction to Sequencing and Scheduling. New York: John Wiley & Sons.
  • Baker, K. R., and J. W. M. Bertrand. 1981. “A Comparison of Due-Date Selection Rules.” AIIE Transactions 13 (2): 123–131. doi: 10.1080/05695558108974544
  • Baker, K. R., and J. J. Kanet. 1983. “Job Shop Scheduling with Modified Due Dates.” Journal of Operations Management 4 (1): 11–22. doi: 10.1016/0272-6963(83)90022-0
  • Banker, R. D., A. Charnes, and W. W. Cooper. 1984. “Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis.” Management Science 30 (9): 1078–1092. doi: 10.1287/mnsc.30.9.1078
  • Blackstone, J. H., D. T. Phillips, and G. L. Hogg. 1982. “A State-of-the-art Survey of Dispatching Rules for Manufacturing Job Shop Operations.” The International Journal of Production Research 20 (1): 27–45. doi: 10.1080/00207548208947745
  • Boukef, H., M. Benrejeb, and P. Borne. 2007. “A Proposed Genetic Algorithm Coding for Flow-Shop Scheduling Problems.” International Journal of Computers Communications & Control 2 (3): 229–240. doi: 10.15837/ijccc.2007.3.2356
  • Braglia, M., and A. Petroni. 1999. “Data Envelopment Analysis for Dispatching Rule Selection.” Production Planning & Control 10 (5): 454–461. doi: 10.1080/095372899232984
  • Branke, J., S. Nguyen, C. W. Pickardt, and M. Zhang. 2015. “Automated Design of Production Scheduling Heuristics: A Review.” IEEE Transactions on Evolutionary Computation 20 (1): 110–124. doi: 10.1109/TEVC.2015.2429314
  • Carroll, D. C. 1965. Heuristic Sequencing of Jobs with Single and Multiple Components. Cambridge, MA: Sloan School of Management, Massachusetts Institute of Technology.
  • Chang, Y. L., T. Sueyoshi, and R. S. Sullivan. 1996. “Ranking Dispatching Rules by Data Envelopment Analysis in a Job Shop Environment.” IIE Transactions 28 (8): 631–642. doi: 10.1080/15458830.1996.11770708
  • Charnes, A., W. W. Cooper, and E. Rhodes. 1978. “Measuring the Efficiency of Decision Making Units.” European Journal of Operational Research 2 (6): 429–444. doi: 10.1016/0377-2217(78)90138-8
  • Chen, X., H. Wen Lin, and T. Murata. 2012. “Composite Dispatching Rule Design for Dynamic Scheduling with Customer-Oriented Production Priority Control.” IEEJ Transactions on Electrical and Electronic Engineering 7 (1): 53–61. doi: 10.1002/tee.21695
  • Cook, W. D., K. Tone, and J. Zhu. 2014. “Data Envelopment Analysis: Prior to Choosing a Model.” Omega 44: 1–4. doi: 10.1016/j.omega.2013.09.004
  • Cooper, W. W., L. M. Seiford, and H. Tone. 2002. Data Envelopment Analysis: A Comprehensive Text with Models, Applications, References, and DEA-Solver Software. New York: Kluwer Academic Publisher.
  • Dominic, P. D., S. Kaliyamoorthy, and M. S. Kumar. 2004. “Efficient Dispatching Rules for Dynamic Job Shop Scheduling.” The International Journal of Advanced Manufacturing Technology 24 (1-2): 70–75.
  • Durasević, M., and D. Jakobović. 2018. “Evolving Dispatching Rules for Optimising Many-Objective Criteria in the Unrelated Machines Environment.” Genetic Programming and Evolvable Machines 19 (1-2): 9–51. doi: 10.1007/s10710-017-9310-3
  • El-Bouri, A. 2012. “A Cooperative Dispatching Approach for Minimizing Mean Tardiness in a Dynamic Flowshop.” Computers & Operations Research 39 (7): 1305–1314. doi: 10.1016/j.cor.2011.07.004
  • El Bouri, A., and G. R. Amin. 2015. “A Combined OWA–DEA Method for Dispatching Rule Selection.” Computers & Industrial Engineering 88: 470–478. doi: 10.1016/j.cie.2015.08.007
  • Fry, T. D., M. D. Oliff, E. D. Minor, and G. Keong Leong. 1989. “The Effects of Product Structure and Sequencing Rule on Assembly Shop Performance.” International Journal of Production Research 27 (4): 671–686. doi: 10.1080/00207548908942575
  • Gavgani, S. S., M. Zohrehbandian, and N. Sadeghi. 2017. “Selecting Dispatching Rule in Manufacturing Systems via DEA Cross Efficiency.” International Journal of Information and Decision Sciences 9 (2): 168–178. doi: 10.1504/IJIDS.2017.084887
  • Heger, J., J. Branke, T. Hildebrandt, and B. Scholz-Reiter. 2016. “Dynamic Adjustment of Dispatching Rule Parameters in Flow Shops with Sequence-Dependent Set-up Times.” International Journal of Production Research 54 (22): 6812–6824. doi: 10.1080/00207543.2016.1178406
  • Ho, T. F., and R. K. Li. 2004. “Heuristic Dispatching Rule to Maximize TDD and IDD Performance.” International Journal of Production Research 42 (24): 5133–5147. doi: 10.1080/0020754042000270421
  • Huang, J., and G. A. Süer. 2015. “A Dispatching Rule-Based Genetic Algorithm for Multi-Objective Job Shop Scheduling Using Fuzzy Satisfaction Levels.” Computers & Industrial Engineering 86: 29–42. doi: 10.1016/j.cie.2014.12.001
  • Ingimundardottir, H., and T. P. Runarsson. 2018. “Discovering Dispatching Rules From Data Using Imitation Learning: A Case Study for the Job-Shop Problem.” Journal of Scheduling 21 (4): 413–428. doi: 10.1007/s10951-017-0534-0
  • Jahanshahloo, G. R., F. H. Lotfi, Y. Jafari, and R. Maddahi. 2011. “Selecting Symmetric Weights as a Secondary Goal in DEA Cross-Efficiency Evaluation.” Applied Mathematical Modelling 35 (1): 544–549. doi: 10.1016/j.apm.2010.07.020
  • Jun, S., S. Lee, and H. Chun. 2019. “Learning Dispatching Rules Using Random Forest in Flexible Job Shop Scheduling Problems.” International Journal of Production Research 57 (10): 3290–3310. doi: 10.1080/00207543.2019.1581954
  • Liu, C. Y., and S. C. Chang. 2000. “Scheduling Flexible Flow Shops with Sequence-Dependent Setup Effects.” IEEE Transactions on Robotics and Automation 16 (4): 408–419. doi: 10.1109/70.864235
  • Lodree Jr, E., W. Jang, and C. M. Klein. 2004. “A New Rule for Minimizing the Number of Tardy Jobs in Dynamic Flow Shops.” European Journal of Operational Research 159 (1): 258–263. doi: 10.1016/S0377-2217(03)00404-1
  • Manupati, V. K., A. S. Revanth, K. S. S. L. Srikanth, A. Maheedhar, and M. S. Reddy. 2016. “Real-time Rule-Based Scheduling System for Integrated Delivery in a Semiconductor Manufacturing Using Evolutionary Algorithm-Based Simulation Approach.” In Artificial Intelligence and Evolutionary Computations in Engineering Systems, edited by S. Dash, M. Bhaskar, B. Panigrahi, and S. Das, 981–989. New Delhi: Springer.
  • Morton, T., and D. W. Pentico. 1993. Heuristic Scheduling Systems: with Applications to Production Systems and Project Management. New York: John Wiley & Sons.
  • Oral, M., G. R. Amin, and A. Oukil. 2015. “Cross-efficiency in DEA: A Maximum Resonated Appreciative Model.” Measurement 63: 159–167. doi: 10.1016/j.measurement.2014.12.006
  • Oral, M., A. Oukil, J. L. Malouin, and O. Kettani. 2014. “The Appreciative Democratic Voice of DEA: A Case of Faculty Academic Performance Evaluation.” Socio-Economic Planning Sciences 48 (1): 20–28. doi: 10.1016/j.seps.2013.08.003
  • Oukil, A. 2018. “Ranking via Composite Weighting Schemes Under a DEA Cross-Evaluation Framework.” Computers & Industrial Engineering 117: 217–224. doi: 10.1016/j.cie.2018.01.022
  • Oukil, A. 2019a. “Embedding OWA Under Preference Ranking for DEA Cross-Efficiency Aggregation: Issues and Procedures.” International Journal of Intelligent Systems 34 (5): 947–965. doi: 10.1002/int.22082
  • Oukil, A. 2019b. “Exploiting Value System Multiplicity and Preference Voting for Robust Ranking.” Omega. doi:10.1016/j.omega.2019.03.006.
  • Oukil, A., and G. R. Amin. 2015. “Maximum Appreciative Cross-Efficiency in DEA: A New Ranking Method.” Computers & Industrial Engineering 81: 14–21. doi: 10.1016/j.cie.2014.12.020
  • Oukil, A., and S. M. Govindaluri. 2017. “A Systematic Approach for Ranking Football Players Within an Integrated DEA-OWA Framework.” Managerial and Decision Economics 38 (8): 1125–1136. doi: 10.1002/mde.2851
  • Ozturk, G., O. Bahadir, and A. Teymourifar. 2019. “Extracting Priority Rules for Dynamic Multi-Objective Flexible job Shop Scheduling Problems Using Gene Expression Programming.” International Journal of Production Research 57 (10): 3121–3137. doi: 10.1080/00207543.2018.1543964
  • Pearn, W. L., S. H. Chung, A. Y. Chen, and M. H. Yang. 2004. “A Case Study on the Multistage IC Final Testing Scheduling Problem with Reentry.” International Journal of Production Economics 88 (3): 257–267. doi: 10.1016/S0925-5273(03)00186-5
  • Pergher, I., and A. T. de Almeida. 2018. “A Multi-Attribute, Rank-Dependent Utility Model for Selecting Dispatching Rules.” Journal of Manufacturing Systems 46: 264–271. doi: 10.1016/j.jmsy.2018.01.007
  • Rajendran, C. 1993. “Heuristic Algorithm for Scheduling in a Flowshop to Minimize Total Flowtime.” International Journal of Production Economics 29 (1): 65–73. doi: 10.1016/0925-5273(93)90024-F
  • Rajendran, C., and O. Holthaus. 1999. “A Comparative Study of Dispatching Rules in Dynamic Flowshops and Jobshops.” European Journal of Operational Research 116 (1): 156–170. doi: 10.1016/S0377-2217(98)00023-X
  • Sadik, A., and B. Urban. 2017. “Flow Shop Scheduling Problem and Solution in Cooperative Robotics—Case-Study: One Cobot in Cooperation with One Worker.” Future Internet 9 (3): 48. doi: 10.3390/fi9030048
  • Saeidi, R. G., A. Oukil, G. R. Amin, and S. Raissi. 2015. “Prioritization of Textile Fabric Defects Using Ordered Weighted Averaging Operator.” The International Journal of Advanced Manufacturing Technology 76 (5-8): 745–752. doi: 10.1007/s00170-014-6227-3
  • Seiford, L. M., and J. Zhu. 2002. “Modeling Undesirable Factors in Efficiency Evaluation.” European Journal of Operational Research 142 (1): 16–20. doi: 10.1016/S0377-2217(01)00293-4
  • Sexton, T. R., R. H. Silkman, and A. J. Hogan. 1986. “Data Envelopment Analysis: Critique and Extensions.” In Measuring Efficiency: An Assessment of Data Envelopment Analysis, edited by R. H. Silkman, 73–105. San Francisco, CA: Jossey Bass.
  • Sun, Y., C. Zhang, L. Gao, and X. Wang. 2011. “Multi-objective Optimization Algorithms for Flow Shop Scheduling Problem: a Review and Prospects.” The International Journal of Advanced Manufacturing Technology 55 (5-8): 723–739. doi: 10.1007/s00170-010-3094-4
  • Torra, V. 2004. “OWA Operators in Data Modeling and Reidentification.” IEEE Transactions on Fuzzy Systems 12 (5): 652–660. doi: 10.1109/TFUZZ.2004.834814
  • Valledor, P., A. Gomez, P. Priore, and J. Puente. 2018. “Solving Multi-Objective Rescheduling Problems in Dynamic Permutation Flow Shop Environments with Disruptions.” International Journal of Production Research 56 (19): 6363–6377. doi: 10.1080/00207543.2018.1468095
  • Vepsalainen, A. P., and T. E. Morton. 1987. “Priority Rules for Job Shops with Weighted Tardiness Costs.” Management Science 33 (8): 1035–1047. doi: 10.1287/mnsc.33.8.1035
  • Waikar, A. M., B. R. Sarker, and A. M. Lal. 1995. “A Comparative Study of Some Priority Dispatching Rules Under Different Shop Loads.” Production Planning & Control 6 (4): 301–310. doi: 10.1080/09537289508930284
  • Wang, Y. M., and C. Parkan. 2005. “A Minimax Disparity Approach for Obtaining OWA Operator Weights.” Information Sciences 175 (1-2): 20–29. doi: 10.1016/j.ins.2004.09.003
  • Xu, J., and X. Zhou. 2009. “A Class of Multi-Objective Expected Value Decision-Making Model with Birandom Coefficients and its Application to Flow Shop Scheduling Problem.” Information Sciences 179 (17): 2997–3017. doi: 10.1016/j.ins.2009.04.009
  • Yager, R. R. 1995. “An Approach to Ordinal Decision Making.” International Journal of Approximate Reasoning 12 (3-4): 237–261. doi: 10.1016/0888-613X(94)00035-2
  • Yang, T., Y. Kuo, and I. Chang. 2004. “Tabu-search Simulation Optimization Approach for Flow-Shop Scheduling with Multiple Processors—a Case Study.” International Journal of Production Research 42 (19): 4015–4030. doi: 10.1080/00207540410001699381
  • Zhou, Y., J. J. Yang, and Z. Huang. 2019. “Automatic Design of Scheduling Policies for Dynamic Flexible Job Shop Scheduling via Surrogate-Assisted Cooperative co-Evolution Genetic Programming.” International Journal of Production Research. doi:10.1080/00207543.2019.1620362.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.