{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:46:36Z","timestamp":1768981596588,"version":"3.49.0"},"reference-count":24,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["GS"],"published-print":{"date-parts":[[2023,10,24]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>This paper aims to investigate the grey scheduling, which is the combination of grey system theory and scheduling problems with uncertain processing time. Based on the interval grey number and its related definitions, properties, and theorems, the single machine scheduling with uncertain processing time and its general forms are studied as the research object. Then several single machine scheduling models are reconstructed, and an actual production case is developed to illustrate the rationality of the research.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>In this paper, the authors first summarize the definitions and properties related to interval grey numbers, especially the transitivity of the partial order of interval grey numbers, and give an example to illustrate that the transitivity has a positive effect on the computational time complexity of multiple interval grey number comparisons. Second, the authors redefine the general form of the single machine scheduling problem with uncertain processing time according to the definitions and theorems of interval grey numbers. The authors then reconstruct three single machine scheduling models with uncertain processing time, give the corresponding heuristic algorithms based on the interval grey numbers and prove them. Finally, the authors develop a case study based on the engine test shop of K Company, the results show that the proposed single machine scheduling models and algorithms with uncertain processing time can provide effective guidance for actual production in an uncertain environment.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The main findings of this paper are as follows: (1) summarize the definitions and theorems related to interval grey numbers and prove the transitivity of the partial order of interval grey numbers; (2) define the general form of the single machine scheduling problem with interval grey processing time; (3) reconstruct three single machine scheduling models with uncertain processing time and give the corresponding heuristic algorithms; (4) develop a case study to illustrate the rationality of the research.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Research limitations\/implications<\/jats:title><jats:p>In the further research, the authors will continue to summarize more advanced general forms of grey scheduling, improve the theory of grey scheduling and prove it, and further explore the application of grey scheduling in the real world. In general, grey scheduling needs to be further combined with grey system theory to form a complete theoretical system.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>It is a fundamental work to define the general form of single machine scheduling with uncertain processing time used the interval grey number. However, it can be seen as an important theoretical basis for the grey scheduling, and it is also beneficial to expand the application of grey system theory in real world.<\/jats:p><\/jats:sec>","DOI":"10.1108\/gs-03-2023-0030","type":"journal-article","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T08:48:46Z","timestamp":1689065326000},"page":"713-729","source":"Crossref","is-referenced-by-count":4,"title":["Single machine scheduling with interval grey processing time"],"prefix":"10.1108","volume":"13","author":[{"given":"Naiming","family":"Xie","sequence":"first","affiliation":[]},{"given":"Yuquan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"140","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"key2023102112381212600_ref001","doi-asserted-by":"publisher","first-page":"2235","DOI":"10.1007\/s40747-021-00400-2","article-title":"A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time","volume":"7","year":"2021","journal-title":"Complex and Intelligent Systems"},{"key":"key2023102112381212600_ref002","first-page":"110","article-title":"Rough set decision making model based on dominance grey degree","volume":"28","year":"2016","journal-title":"Journal of Grey System"},{"key":"key2023102112381212600_ref003","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109783","article-title":"An elite genetic algorithm for flexible job shop scheduling problem with extracted grey processing time","volume":"131","year":"2022","journal-title":"Applied Soft Computing"},{"key":"key2023102112381212600_ref004","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.eswa.2016.07.046","article-title":"An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time","volume":"65","year":"2016","journal-title":"Expert Systems with Applications"},{"key":"key2023102112381212600_ref005","first-page":"91","article-title":"A novel dominance relation and application in interval grey number decision model","volume":"26","year":"2014","journal-title":"Journal of Grey System"},{"key":"key2023102112381212600_ref006","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/S0167-6911(82)80025-X","article-title":"Control problems of grey systems","volume":"1","year":"1982","journal-title":"Systems and Control Letters"},{"key":"key2023102112381212600_ref007","first-page":"1","article-title":"Introduction to grey system theory","volume":"1","year":"1989","journal-title":"Journal of Grey System"},{"key":"key2023102112381212600_ref008","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1016\/j.cie.2011.07.010","article-title":"Population-based neighborhood search for job shop scheduling with interval processing time","volume":"61","year":"2011","journal-title":"Computers and Industrial Engineering"},{"key":"key2023102112381212600_ref009","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/TSC.2013.30","article-title":"Improving heterogeneous SOA-based IoT message stability by shortest processing time scheduling","volume":"7","year":"2014","journal-title":"IEEE Transactions on Services Computing"},{"key":"key2023102112381212600_ref010","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1016\/j.cie.2019.04.028","article-title":"Particle swarm optimization hybridized with genetic algorithm for uncertain integrated process planning and scheduling with interval processing time","volume":"135","year":"2019","journal-title":"Computers and Industrial Engineering"},{"key":"key2023102112381212600_ref011","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1108\/03684920610662692","article-title":"On measures of information content of grey numbers","volume":"35","year":"2006","journal-title":"Kybernetes"},{"key":"key2023102112381212600_ref012","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1108\/20439371211273230","article-title":"General grey numbers and their operations","volume":"2","year":"2012","journal-title":"Grey Systems: Theory and Applications"},{"key":"key2023102112381212600_ref013","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1108\/GS-09-2016-0031","article-title":"Explanation of terms of grey numbers and its operations","volume":"6","year":"2016","journal-title":"Grey Systems: Theory and Applications"},{"key":"key2023102112381212600_ref014","doi-asserted-by":"publisher","first-page":"161","DOI":"10.3233\/JIFS-181071","article-title":"A novel method for solving linear programming with grey parameters","volume":"36","year":"2019","journal-title":"Journal of Intelligent and Fuzzy Systems"},{"key":"key2023102112381212600_ref015","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(99)00319-7","article-title":"On comparing interval numbers","volume":"127","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"key2023102112381212600_ref016","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1108\/GS-09-2020-0123","article-title":"Flexible flow shop scheduling with interval grey processing time","volume":"11","year":"2021","journal-title":"Grey Systems: Theory and Applications"},{"key":"key2023102112381212600_ref017","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1108\/GS-11-2012-0044","article-title":"On computational algorithms of grey numbers based on information background","volume":"3","year":"2013","journal-title":"Grey Systems: Theory and Applications"},{"key":"key2023102112381212600_ref018","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.asoc.2018.06.004","article-title":"Flexible job shop scheduling problem with interval grey processing time","volume":"70","year":"2018","journal-title":"Applied Soft Computing"},{"key":"key2023102112381212600_ref019","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.apm.2009.05.001","article-title":"Novel methods on comparing grey numbers","volume":"34","year":"2010","journal-title":"Applied Mathematical Modelling"},{"key":"key2023102112381212600_ref020","first-page":"21","article-title":"Comparing grey number weights under interval probability information background","volume":"27","year":"2015","journal-title":"The Journal of Grey System"},{"key":"key2023102112381212600_ref021","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1108\/20439371111106731","article-title":"Reliability of operations of grey numbers using kernels","volume":"1","year":"2013","journal-title":"Grey Systems: Theory and Applications"},{"key":"key2023102112381212600_ref022","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","article-title":"Fuzzy sets","volume":"8","year":"1965","journal-title":"Information and Control"},{"key":"key2023102112381212600_ref023","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106781","article-title":"Flexible job-shop scheduling problem with job precedence constraints and interval grey processing time","volume":"149","year":"2020","journal-title":"Computers and Industrial Engineering"},{"key":"key2023102112381212600_ref024","article-title":"A multi-objective multi-micro-swarm leadership hierarchy-based optimizer for uncertain flexible job shop scheduling problem with job precedence constraints","volume":"182","year":"2021","journal-title":"Expert Systems with Applications"}],"container-title":["Grey Systems: Theory and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/GS-03-2023-0030\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/GS-03-2023-0030\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:45:40Z","timestamp":1753404340000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/gs\/article\/13\/4\/713-729\/100165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":24,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,7,12]]},"published-print":{"date-parts":[[2023,10,24]]}},"alternative-id":["10.1108\/GS-03-2023-0030"],"URL":"https:\/\/doi.org\/10.1108\/gs-03-2023-0030","relation":{},"ISSN":["2043-9377"],"issn-type":[{"value":"2043-9377","type":"print"}],"subject":[],"published":{"date-parts":[[2023,7,12]]}}}