{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:18:44Z","timestamp":1773656324229,"version":"3.50.1"},"reference-count":26,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1134\/s0005117919020085","type":"journal-article","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:09:40Z","timestamp":1556158180000},"page":"297-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Heuristic Algorithms to Maximize Revenue and the Number of Jobs Processed on Parallel Machines"],"prefix":"10.1134","volume":"80","author":[{"given":"O.","family":"Gholami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y. N.","family":"Sotskov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. S.","family":"Zatsiupo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2019,4,25]]},"reference":[{"issue":"3","key":"930_CR1","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00186-006-0127-8","volume":"65","author":"P. Brucker","year":"2007","unstructured":"Brucker, P., Sotskov, Y.N., and Werner, F., Complexity of Shop\u2013Scheduling Problems with Fixed Number of Jobs: A Survey, Math. Methods Oper. Res., 2007, vol. 65, no. 3, pp. 461\u2013481.","journal-title":"Math. Methods Oper. Res."},{"key":"930_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"R.E. Graham","year":"1979","unstructured":"Graham, R.E., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan A.H.G., Optimization and Approximation in Deterministic Sequencing and Scheduling a Survey, Ann. Discret. Math., 1979, vol. 4, pp. 287\u2013326.","journal-title":"Ann. Discret. Math."},{"issue":"3","key":"930_CR3","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1016\/j.ejor.2003.08.059","volume":"161","author":"A. Anglani","year":"2005","unstructured":"Anglani, A., Grieco, A., Guerriero, E., and Musmanno, R., Robust Scheduling of Parallel Machines with Sequence\u2013Dependent Set\u2013up Cost, Eur. J. Oper. Res., 2005, vol. 161, no. 3, pp. 704\u2013720.","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"930_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10479-007-0284-z","volume":"159","author":"G. Feng","year":"2008","unstructured":"Feng, G. and Lau, H.C., Efficient Algorithm for Machine Scheduling Problems with Earliness and Tardiness Penalties, Ann. Oper. Res., 2008, vol. 159, no. 1, pp. 83\u201395.","journal-title":"Ann. Oper. Res."},{"key":"930_CR5","volume-title":"Int. J. Adv. Manuf. Technol.","author":"A. Berrichi","year":"2013","unstructured":"Berrichi, A. and Yalaoui, F., Efficient Bi\u2013Objective ant Colony Approach to Minimize Total Tardiness and System Unavailability for a Parallel Machine Scheduling Problem, Int. J. Adv. Manuf. Technol., 2013, vol. 68, no. 9\u201312, pp. 2295\u20132310."},{"key":"930_CR6","volume-title":"Int. J. Adv. Manuf. Technol.","author":"Y.K. Lin","year":"2013","unstructured":"Lin, Y.K. and Lin, C.W., Dispatching Rules for Unrelated Parallel Machine Scheduling with Release Dates, Int. J. Adv. Manuf. Technol., 2013, vol. 67, no. 1\u20134, pp. 269\u2013279."},{"issue":"6","key":"930_CR7","doi-asserted-by":"publisher","first-page":"6814","DOI":"10.1016\/j.eswa.2010.12.064","volume":"38","author":"S. Balin","year":"2011","unstructured":"Balin, S., Non\u2013Identical Parallel Machine Scheduling Using Genetic Algorithm, Expert Syst. Appl., 2011, vol. 38, no. 6, pp. 6814\u20136821.","journal-title":"Expert Syst. Appl."},{"key":"930_CR8","unstructured":"Juraszek, J., Sterna, M., and Pesch, E., Revenue Maximization on Parallel Machines, Institute of Computing Science, Poznan University of Technology, pp. 960\u2013965, Poznan, Poland."},{"key":"930_CR9","volume-title":"Operations Research: A Practical Introduction","author":"M.W. Carter","year":"2001","unstructured":"Carter, M.W. and Price, C.C., Operations Research: A Practical Introduction, Textbook, Boca Raton: CRC Press, 2001."},{"key":"930_CR10","volume-title":"Non\u2013Identical ParallelMachine Scheduling with Fuzzy Processing Times Using Robust Genetic Algorithm and Simulation","author":"S. Balin","year":"2012","unstructured":"Balin, S., Non\u2013Identical ParallelMachine Scheduling with Fuzzy Processing Times Using Robust Genetic Algorithm and Simulation, Int. J. Innovat. Comput. Inform. Control, 2012, vol. 8, no. 1\u2013B, pp. 727\u2013745."},{"issue":"4","key":"930_CR11","doi-asserted-by":"publisher","first-page":"2145","DOI":"10.1016\/j.apm.2008.05.019","volume":"33","author":"K. Li","year":"2009","unstructured":"Li, K. and Yang, S.\u2013L., Non\u2013Identical Parallel\u2013Machine Scheduling Research with Minimizing Total Weighted Completion Times: Models, Relaxations and Algorithms, Appl. Math. Modell., 2009, vol. 33, no. 4, pp. 2145\u20132158.","journal-title":"Relaxations and Algorithms, Appl. Math. Modell."},{"key":"930_CR12","volume-title":"Scheduling, SCIS\u2019 07, IEEE Sympos","author":"S. Xu","year":"2007","unstructured":"Xu, S. and Bean, J.C., A Genetic Algorithm for Scheduling Parallel Non\u2013Identical Batch Processing Machines, Comput. Intelligen. Scheduling, SCIS\u2019 07, IEEE Sympos., 2007, pp. 143\u2013150."},{"issue":"1","key":"930_CR13","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10479-012-1164-8","volume":"201","author":"F. Rodriguez","year":"2012","unstructured":"Rodriguez, F., Blum, C., Garcia\u2013Martinez, C., and Lozano, M., GRASP with Path\u2013Relinking for the Non\u2013Identical Parallel Machine Scheduling Problem with Minimising TotalWeighted Completion Times, Ann. Oper. Res., 2012, vol. 201, no. 1, pp. 383\u2013401.","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"930_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1504\/IJMTM.2011.038481","volume":"22","author":"W. Supithak","year":"2011","unstructured":"Supithak, W. and Plongon, K., Memetic Algorithm for Non\u2013Identical Parallel Machines Scheduling Problem with Earliness and Tardiness Penalties, Int. J. Manuf. Technol. Manage., 2011, vol. 22, no. 1, pp. 26\u201338.","journal-title":"Int. J. Manuf. Technol. Manage."},{"issue":"11","key":"930_CR15","doi-asserted-by":"publisher","first-page":"3420","DOI":"10.1016\/j.cor.2006.02.006","volume":"34","author":"R. Logendran","year":"2007","unstructured":"Logendran, R., McDonell, B., and Smuckera, B., Scheduling Unrelated ParallelMachines with Sequence\u2013Dependent Setups, Comput. Oper. Res., 2007, vol. 34, no. 11, pp. 3420\u20133438.","journal-title":"Comput. Oper. Res."},{"key":"930_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1109\/WAC.2002.1049430","volume":"14","author":"G. Anagnostopoulos","year":"2002","unstructured":"Anagnostopoulos, G. and Rabadi, G., A Simulated Annealing Algorithm for the Unrelated Parallel Machine Scheduling Problem, Proc. 5th Biannual World Autom. Congr. 2002, 2002, vol. 14, pp. 115\u2013120.","journal-title":"Proc. 5th Biannual World Autom. Congr. 2002"},{"issue":"8","key":"930_CR17","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/S0305-0548(98)00090-2","volume":"26","author":"F. Sivrikaya\u2013Serifoglu","year":"1999","unstructured":"Sivrikaya\u2013Serifoglu, F. and Ulusoy, G., Parallel Machine Scheduling with Earliness and Tardiness Penalties, Comput. Oper. Res., 1999, vol. 26, no. 8, pp. 773\u2013787.","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"930_CR18","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0305-0548(02)00198-3","volume":"31","author":"U. Bilge","year":"2004","unstructured":"Bilge, U., Kirac, F., Kurtulan, M., and Pekgun, P., A Tabu Search Algorithm for Parallel Machine Total Tardiness Problem, Comput. Oper. Res., 2004, vol. 31, no. 3, pp. 397\u2013414.","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"930_CR19","first-page":"269","volume":"21","author":"R. Tavakkoli\u2013Moghaddam","year":"2008","unstructured":"Tavakkoli\u2013Moghaddam, R., Taheri, F., and Bazzazi, M., Multi\u2013Objective Unrelated Machines Scheduling with Sequence\u2013Dependent Setup Times and Precedence Constrains, IEE Transactions A: Basics, 2008, vol. 21, no. 3, pp. 269\u2013278.","journal-title":"IEE Transactions A: Basics"},{"issue":"9","key":"930_CR20","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1016\/j.cor.2004.03.013","volume":"32","author":"S. Dunstall","year":"2005","unstructured":"Dunstall, S. and Wirth, A., Heuristic Methods for the Identical Parallel Machine Problem with Set\u2013up Times, Comput. Oper. Res., 2005, vol. 32, no. 9, pp. 2479\u20132491.","journal-title":"Comput. Oper. Res."},{"key":"930_CR21","volume-title":"Revenue Maximization on Parallel Machines, Book Chapter, Oper. Res. Proc.","author":"M. Sterna","year":"2008","unstructured":"Sterna, M., Juraszek, J., and Pesch, E., Revenue Maximization on Parallel Machines, Book Chapter, Oper. Res. Proc., 2008, pp. 153\u2013158."},{"key":"930_CR22","volume-title":"Revenue Maximization in Market\u2013Based Parallel Job Schedulers, Technical Report, Ohio State University","author":"M. Islam","year":"2008","unstructured":"Islam, M., Khanna, G., and Sadayappan, P., Revenue Maximization in Market\u2013Based Parallel Job Schedulers, Technical Report, Ohio State University, OSU\u2013CISRC\u20134\/08\u2013TR16, Ohio, USA, 2008, pp. 1\u201313."},{"issue":"1","key":"930_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1111\/j.1937-5956.2009.01066.x","volume":"19","author":"M. Dawande","year":"2010","unstructured":"Dawande, M., Drobouchevitch, I., Rajapakshe, T., and Sriskandarajah, C., Analysis of Revenue Maximazation under Two Movie\u2013Screening Policies, Product. Oper. Manage., 2010, vol. 19, no. 1, pp. 111\u2013124.","journal-title":"Product. Oper. Manage."},{"key":"930_CR24","volume-title":"Revenue Maximization Using Adaptive Resource Provisioning in Cloud Computing Environments, ASM\/IEEE 13th Int. Conf. Grid Comput.","author":"G. Feng","year":"2012","unstructured":"Feng, G., Garg, S., Buyya, R., and Li, W., Revenue Maximization Using Adaptive Resource Provisioning in Cloud Computing Environments, ASM\/IEEE 13th Int. Conf. Grid Comput., IEEE Comput. Soc., 2012, pp. 192\u2013200. DOI 10.1109\/Grid.2012.16"},{"issue":"5","key":"930_CR25","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F., Future Paths for Integer Programming and Links to Artificial Intelligence, Comput. Oper. Res., 1986, vol. 13, no. 5, pp. 533\u2013549.","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"930_CR26","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1016\/j.cor.2011.02.001","volume":"39","author":"Y.N. Sotskov","year":"2012","unstructured":"Sotskov, Y.N. and Lai, T.-C., Minimizing Total Weighted Flow Time under Uncertainty Using Dominance and a Stability Box, Comput. Oper. Res., 2012, vol. 39, no. 6, pp. 1271\u20131289.","journal-title":"Comput. Oper. Res."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117919020085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117919020085","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117919020085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:30:09Z","timestamp":1773613809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117919020085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["930"],"URL":"https:\/\/doi.org\/10.1134\/s0005117919020085","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]},"assertion":[{"value":"20 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}