乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:25Z","timestamp":1740103825500,"version":"3.37.3"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T00:00:00Z","timestamp":1553472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10951-019-00605-x","type":"journal-article","created":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T12:02:46Z","timestamp":1553515366000},"page":"499-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A unified view of parallel machine scheduling with interdependent processing rates"],"prefix":"10.1007","volume":"22","author":[{"given":"Bahram","family":"Alidaee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8580-829X","authenticated-orcid":false,"given":"Haibo","family":"Wang","sequence":"additional","affiliation":[]},{"given":"R. Bryan","family":"Kethley","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Landram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,25]]},"reference":[{"issue":"4","key":"605_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0305-0548(87)90066-9","volume":"14","author":"I Adiri","year":"1987","unstructured":"Adiri, I., & Yehudai, Z. (1987). Scheduling on machines with variable service rates. Computers & Operations Research,\n 14(4), 289\u2013297. \n https:\/\/doi.org\/10.1016\/0305-0548(87)90066-9\n \n .","journal-title":"Computers & Operations Research"},{"issue":"2","key":"605_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1109\/TAC.2007.915166","volume":"53","author":"M Aicardi","year":"2008","unstructured":"Aicardi, M., Giglio, D., & Minciardi, R. (2008). Optimal strategies for multiclass job scheduling on a single machine with controllable processing times. IEEE Transactions on Automatic Control,\n 53(2), 479\u2013495. \n https:\/\/doi.org\/10.1109\/TAC.2007.915166\n \n .","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"3","key":"605_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0377-2217(93)90245-I","volume":"70","author":"B Alidaee","year":"1993","unstructured":"Alidaee, B., & Ahmadian, A. (1993). Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research,\n 70(3), 335\u2013341. \n https:\/\/doi.org\/10.1016\/0377-2217(93)90245-I\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"605_CR4","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1287\/trsc.1030.0055","volume":"39","author":"B Alidaee","year":"2005","unstructured":"Alidaee, B., & Kochenberger, G. A. (2005). A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem. Transportation Science,\n 39(1), 140\u2013143. \n https:\/\/doi.org\/10.1287\/trsc.1030.0055\n \n .","journal-title":"Transportation Science"},{"issue":"1","key":"605_CR5","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1109\/TASE.2013.2247757","volume":"11","author":"B Alidaee","year":"2014","unstructured":"Alidaee, B., & Li, H. (2014). Parallel machine selection and job scheduling to minimize sum of machine holding cost, total machine time costs, and total tardiness costs. IEEE Transactions on Automation Science and Engineering,\n 11(1), 294\u2013301. \n https:\/\/doi.org\/10.1109\/TASE.2013.2247757\n \n .","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"7","key":"605_CR6","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1057\/palgrave.jors.2600740","volume":"50","author":"B Alidaee","year":"1999","unstructured":"Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society,\n 50(7), 711\u2013720. \n https:\/\/doi.org\/10.1057\/palgrave.jors.2600740\n \n .","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"605_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega,\n 27(2), 219\u2013239. \n https:\/\/doi.org\/10.1016\/S0305-0483(98)00042-5\n \n .","journal-title":"Omega"},{"issue":"1","key":"605_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G. J., & Yadid, T. (1998). Approximation schemes for scheduling on parallel machines. Journal of Scheduling,\n 1(1), 55\u201366.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"605_CR9","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/S0377-2217(96)00240-8","volume":"102","author":"HF Amaddeo","year":"1997","unstructured":"Amaddeo, H. F., Nawijn, W. M., & van Harten, A. (1997). One-machine job-scheduling with non-constant capacity\u2014Minimizing weighted completion times. European Journal of Operational Research,\n 102(3), 502\u2013512. \n https:\/\/doi.org\/10.1016\/S0377-2217(96)00240-8\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"605_CR10","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1002\/nav.3800270313","volume":"27","author":"KR Baker","year":"1980","unstructured":"Baker, K. R., & Nuttle, H. L. (1980). Sequencing independent jobs with a single resource. Naval Research Logistics Quarterly,\n 27(3), 499\u2013510. \n https:\/\/doi.org\/10.1002\/nav.3800270313\n \n .","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"605_CR11","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.asoc.2011.09.007","volume":"12","author":"S Baradaran","year":"2012","unstructured":"Baradaran, S., Fatemi Ghomi, S. M. T., Ranjbar, M., & Hashemin, S. S. (2012). Multi-mode renewable resource-constrained allocation in PERT networks. Applied Soft Computing,\n 12(1), 82\u201390. \n https:\/\/doi.org\/10.1016\/j.asoc.2011.09.007\n \n .","journal-title":"Applied Soft Computing"},{"issue":"4","key":"605_CR12","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1016\/j.cor.2012.11.011","volume":"40","author":"J Beli\u00ebn","year":"2013","unstructured":"Beli\u00ebn, J., Demeulemeester, E., De Bruecker, P., Van den Bergh, J., & Cardoen, B. (2013). Integrated staffing and scheduling for an aircraft line maintenance problem. Computers & Operations Research,\n 40(4), 1023\u20131033. \n https:\/\/doi.org\/10.1016\/j.cor.2012.11.011\n \n .","journal-title":"Computers & Operations Research"},{"issue":"2","key":"605_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","volume":"188","author":"D Biskup","year":"2008","unstructured":"Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research,\n 188(2), 315\u2013329. \n https:\/\/doi.org\/10.1016\/j.ejor.2007.05.040\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"605_CR14","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.dam.2007.08.008","volume":"156","author":"EK Burke","year":"2008","unstructured":"Burke, E. K., Dror, M., & Orlin, J. B. (2008). Scheduling malleable tasks with interdependent processing rates: Comments and observations. Discrete Applied Mathematics,\n 156(5), 620\u2013626. \n https:\/\/doi.org\/10.1016\/j.dam.2007.08.008\n \n .","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"605_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1137\/0204021","volume":"4","author":"AK Chandra","year":"1975","unstructured":"Chandra, A. K., & Wong, C. K. (1975). Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing,\n 4(3), 249\u2013263. \n https:\/\/doi.org\/10.1137\/0204021\n \n .","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"605_CR16","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1287\/msom.1060.0144","volume":"10","author":"Z-L Chen","year":"2008","unstructured":"Chen, Z.-L., & Hall, N. G. (2008). Maximum profit scheduling. Manufacturing & Service Operations Management,\n 10(1), 84\u2013107. \n https:\/\/doi.org\/10.1287\/msom.1060.0144\n \n .","journal-title":"Manufacturing & Service Operations Management"},{"issue":"1","key":"605_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TCE Cheng","year":"2004","unstructured":"Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research,\n 152(1), 1\u201313. \n https:\/\/doi.org\/10.1016\/S0377-2217(02)00909-8\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"605_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/321921.321933","volume":"23","author":"RA Cody","year":"1976","unstructured":"Cody, R. A., & Jr Coffman, E. G. (1976). Record allocation for minimizing expected retrieval costs on drum-like storage devices. Journal of the ACM,\n 23(1), 103\u2013115. \n https:\/\/doi.org\/10.1145\/321921.321933\n \n .","journal-title":"Journal of the ACM"},{"issue":"2","key":"605_CR19","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"BL Deuermeyer","year":"1982","unstructured":"Deuermeyer, B. L., Friesen, D. K., & Langston, M. A. (1982). Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM Journal on Algebraic Discrete Methods,\n 3(2), 190\u2013196. \n https:\/\/doi.org\/10.1137\/0603019\n \n .","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"8","key":"605_CR20","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1287\/mnsc.33.8.1001","volume":"33","author":"M Dror","year":"1987","unstructured":"Dror, M., Stern, H. I., & Lenstra, J. K. (1987). Parallel machine scheduling: Processing rates dependent on number of jobs in operation. Management Science,\n 33(8), 1001\u20131009. \n https:\/\/doi.org\/10.1287\/mnsc.33.8.1001\n \n .","journal-title":"Management Science"},{"issue":"1","key":"605_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00453-003-1077-7","volume":"39","author":"L Epstein","year":"2004","unstructured":"Epstein, L., & Sgall, J. (2004). Approximation schemes for Schedulingon uniformly related and identical parallel machines. Algorithmica,\n 39(1), 43\u201357. \n https:\/\/doi.org\/10.1007\/s00453-003-1077-7\n \n .","journal-title":"Algorithmica"},{"issue":"1","key":"605_CR22","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/moor.6.1.74","volume":"6","author":"DK Friesen","year":"1981","unstructured":"Friesen, D. K., & Deuermeyer, B. L. (1981). Analysis of greedy solutions for a replacement part sequencing problem. Mathematics of Operations Research,\n 6(1), 74\u201387. \n https:\/\/doi.org\/10.1287\/moor.6.1.74\n \n .","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"605_CR23","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.ejor.2009.09.019","volume":"203","author":"CU F\u00fcndeling","year":"2010","unstructured":"F\u00fcndeling, C. U., & Trautmann, N. (2010). A priority-rule method for project scheduling with work-content constraints. European Journal of Operational Research,\n 203(3), 568\u2013574. \n https:\/\/doi.org\/10.1016\/j.ejor.2009.09.019\n \n .","journal-title":"European Journal of Operational Research"},{"key":"605_CR24","volume-title":"Computers and intractability: A guide to the theory of NP-hardness","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-hardness. San Fransisco: WH Freeman."},{"issue":"6","key":"605_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(96)00021-X","volume":"57","author":"S Gawiejnowicz","year":"1996","unstructured":"Gawiejnowicz, S. (1996). A note on scheduling on a single processor with speed dependent on a number of executed jobs. Information Processing Letters,\n 57(6), 297\u2013300. \n https:\/\/doi.org\/10.1016\/0020-0190(96)00021-X\n \n .","journal-title":"Information Processing Letters"},{"issue":"12","key":"605_CR26","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1109\/TAC.2007.910668","volume":"52","author":"K Gokbayrak","year":"2007","unstructured":"Gokbayrak, K., & Selvi, O. (2007). Constrained optimal hybrid control of a flow shop system. IEEE Transactions on Automatic Control,\n 52(12), 2270\u20132281. \n https:\/\/doi.org\/10.1109\/TAC.2007.910668\n \n .","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"11","key":"605_CR27","doi-asserted-by":"publisher","first-page":"2665","DOI":"10.1109\/TAC.2008.2007153","volume":"53","author":"K Gokbayrak","year":"2008","unstructured":"Gokbayrak, K., & Selvi, O. (2008). Optimization of a flow shop system of initially controllable machines. IEEE Transactions on Automatic Control,\n 53(11), 2665\u20132668. \n https:\/\/doi.org\/10.1109\/TAC.2008.2007153\n \n .","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1","key":"605_CR28","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/322047.322055","volume":"25","author":"T Gonzalez","year":"1978","unstructured":"Gonzalez, T., & Sahni, S. (1978). Preemptive scheduling of uniform processor systems. Journal of the ACM,\n 25(1), 92\u2013101. \n https:\/\/doi.org\/10.1145\/322047.322055\n \n .","journal-title":"Journal of the ACM"},{"issue":"1","key":"605_CR29","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ejor.2009.07.021","volume":"203","author":"M Gorczyca","year":"2010","unstructured":"Gorczyca, M., & Janiak, A. (2010). Resource level minimization in the discrete\u2013continuous scheduling. European Journal of Operational Research,\n 203(1), 32\u201341. \n https:\/\/doi.org\/10.1016\/j.ejor.2009.07.021\n \n .","journal-title":"European Journal of Operational Research"},{"key":"605_CR30","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7494\/dmms.2011.5.1.5","volume":"5","author":"M Gorczyca","year":"2011","unstructured":"Gorczyca, M., Janiak, A., & Janiak, W. (2011). Neighbourhood properties in some single processor scheduling problem with variable efficiency and additional resources. Decision Making in Manufacturing and Services,\n 5, 5\u201317.","journal-title":"Decision Making in Manufacturing and Services"},{"key":"605_CR31","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.dam.2013.10.003","volume":"182","author":"M Gorczyca","year":"2015","unstructured":"Gorczyca, M., Janiak, A., Janiak, W., & Dyma\u0144ski, M. (2015). Makespan optimization in a single-machine scheduling problem with dynamic job ready times\u2014Complexity and algorithms. Discrete Applied Mathematics,\n 182, 162\u2013168. \n https:\/\/doi.org\/10.1016\/j.dam.2013.10.003\n \n .","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"605_CR32","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics,\n 17(2), 416\u2013429. \n https:\/\/doi.org\/10.1137\/0117039\n \n .","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"3","key":"605_CR33","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"DS Hochbaum","year":"1988","unstructured":"Hochbaum, D. S., & Shmoys, D. B. (1988). A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing,\n 17(3), 539\u2013551. \n https:\/\/doi.org\/10.1137\/0217033\n \n .","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"605_CR34","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1287\/opre.34.5.801","volume":"34","author":"HC Huang","year":"1986","unstructured":"Huang, H. C. (1986). On minimizing flow time on processors with variable unit processing time. Operations Research,\n 34(5), 801\u2013802. \n https:\/\/doi.org\/10.1287\/opre.34.5.801\n \n .","journal-title":"Operations Research"},{"issue":"4","key":"605_CR35","first-page":"325","volume":"4","author":"A Janiak","year":"1978","unstructured":"Janiak, A. (1978). Time-optimal control of a sequence of complexes of independent operations with concave models. Systems Science,\n 4(4), 325\u2013338.","journal-title":"Systems Science"},{"issue":"5","key":"605_CR36","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1109\/TSMCA.2007.893485","volume":"37","author":"A Janiak","year":"2007","unstructured":"Janiak, A., Kovalyov, M. Y., & Marek, M. (2007). Soft due window assignment and scheduling on parallel machines. IEEE Transactions on Systems, Man, and Cybernetics\u2014Part A: Systems and Humans,\n 37(5), 614\u2013620. \n https:\/\/doi.org\/10.1109\/TSMCA.2007.893485\n \n .","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics\u2014Part A: Systems and Humans"},{"issue":"1","key":"605_CR37","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7494\/dmms.2011.5.1.19","volume":"5","author":"A Janiak","year":"2011","unstructured":"Janiak, A., Krysiak, T., & Trela, R. (2011). Scheduling problems with learning and ageing effects: A survey. Decision Making in Manufacturing and Services,\n 5(1), 19\u201336.","journal-title":"Decision Making in Manufacturing and Services"},{"issue":"2","key":"605_CR38","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TSMCA.2008.2010757","volume":"39","author":"A Janiak","year":"2009","unstructured":"Janiak, A., & Rudek, R. (2009). Experience-based approach to scheduling problems with the learning effect. IEEE Transactions on Systems, Man, and Cybernetics\u2014Part A: Systems and Humans,\n 39(2), 344\u2013357. \n https:\/\/doi.org\/10.1109\/TSMCA.2008.2010757\n \n .","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics\u2014Part A: Systems and Humans"},{"key":"605_CR39","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cie.2015.10.015","volume":"91","author":"M Ji","year":"2016","unstructured":"Ji, M., Tang, X., Zhang, X., & Cheng, T. C. E. (2016). Machine scheduling with deteriorating jobs and DeJong\u2019s learning effect. Computers & Industrial Engineering,\n 91, 42\u201347. \n https:\/\/doi.org\/10.1016\/j.cie.2015.10.015\n \n .","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"605_CR40","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0377-2217(97)00346-9","volume":"107","author":"J J\u00f3zefowska","year":"1998","unstructured":"J\u00f3zefowska, J., & W\u0119glarz, J. (1998). On a methodology for discrete\u2013continuous scheduling. European Journal of Operational Research,\n 107(2), 338\u2013353. \n https:\/\/doi.org\/10.1016\/S0377-2217(97)00346-9\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"605_CR41","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/1520-6750(198802)35:1<35::AID-NAV3220350104>3.0.CO;2-3","volume":"35","author":"S Julius","year":"1988","unstructured":"Julius, S., & Ali, D. (1988). Minimizing the sum of weighted completion times of n-independent jobs when resource availability varies over time: Performance of a simple priority rule. Naval Research Logistics (NRL),\n 35(1), 35\u201347. \n https:\/\/doi.org\/10.1002\/1520-6750(198802)35:1%3c35:AID-NAV3220350104%3e3.0.CO;2-3\n \n .","journal-title":"Naval Research Logistics (NRL)"},{"issue":"5","key":"605_CR42","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.omega.2010.10.002","volume":"39","author":"P-J Lai","year":"2011","unstructured":"Lai, P.-J., & Lee, W.-C. (2011). Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects. Omega,\n 39(5), 467\u2013471. \n https:\/\/doi.org\/10.1016\/j.omega.2010.10.002\n \n .","journal-title":"Omega"},{"key":"605_CR43","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-68874-4_9","volume-title":"Mathematical programming the state of the art: Bonn 1982","author":"EL Lawler","year":"1983","unstructured":"Lawler, E. L. (1983). Recent results in the theory of machine scheduling. In A. Bachem, B. Korte, & M. Gr\u00f6tschel (Eds.), Mathematical programming the state of the art: Bonn 1982 (pp. 202\u2013234). Berlin, Heidelberg: Springer."},{"issue":"4","key":"605_CR44","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/322092.322101","volume":"25","author":"EL Lawler","year":"1978","unstructured":"Lawler, E. L., & Labetoulle, J. (1978). On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM,\n 25(4), 612\u2013619. \n https:\/\/doi.org\/10.1145\/322092.322101\n \n .","journal-title":"Journal of the ACM"},{"key":"605_CR45","first-page":"445","volume-title":"Handbooks in operations research and management science","author":"EL Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Chapter 9 Sequencing and scheduling: Algorithms and complexity. In V. Linetsky (Ed.), Handbooks in operations research and management science (Vol. 4, pp. 445\u2013522). Amsterdam: Elsevier."},{"issue":"2","key":"605_CR46","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/opre.37.2.314","volume":"37","author":"EL Lawler","year":"1989","unstructured":"Lawler, E. L., & Martel, C. U. (1989). Preemptive scheduling of two uniform machines to minimize the number of late jobs. Operations Research,\n 37(2), 314\u2013318. \n https:\/\/doi.org\/10.1287\/opre.37.2.314\n \n .","journal-title":"Operations Research"},{"issue":"4","key":"605_CR47","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1287\/opre.26.4.563","volume":"26","author":"EL Lawler","year":"1978","unstructured":"Lawler, E. L., & Sivazlian, B. D. (1978). Minimization of time-varying costs in single-machine scheduling. Operations Research,\n 26(4), 563\u2013569. \n https:\/\/doi.org\/10.1287\/opre.26.4.563\n \n .","journal-title":"Operations Research"},{"issue":"24","key":"605_CR48","doi-asserted-by":"publisher","first-page":"5515","DOI":"10.1016\/j.ins.2011.07.051","volume":"181","author":"W-C Lee","year":"2011","unstructured":"Lee, W.-C. (2011). Scheduling with general position-based learning curves. Information Sciences,\n 181(24), 5515\u20135522. \n https:\/\/doi.org\/10.1016\/j.ins.2011.07.051\n \n .","journal-title":"Information Sciences"},{"issue":"1","key":"605_CR49","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0377-2217(99)00066-1","volume":"128","author":"CY Lee","year":"2001","unstructured":"Lee, C. Y., & Leon, V. J. (2001). Machine scheduling with a rate-modifying activity1. This research was supported in part by NSF Grant DMI-9610229, and the US Army Contract DAAB07-95-C-D321.1. European Journal of Operational Research,\n 128(1), 119\u2013128. \n https:\/\/doi.org\/10.1016\/S0377-2217(99)00066-1\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"605_CR50","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0925-5273(02)00427-9","volume":"84","author":"C-J Liao","year":"2003","unstructured":"Liao, C.-J., & Lin, C.-H. (2003). Makespan minimization for two uniform parallel machines. International Journal of Production Economics,\n 84(2), 205\u2013213. \n https:\/\/doi.org\/10.1016\/S0925-5273(02)00427-9\n \n .","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"605_CR51","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ejor.2014.11.019","volume":"243","author":"J Lin","year":"2015","unstructured":"Lin, J., Qian, Y., Cui, W., & Goh, T. N. (2015). An effective approach for scheduling coupled activities in development projects. European Journal of Operational Research,\n 243(1), 97\u2013108. \n https:\/\/doi.org\/10.1016\/j.ejor.2014.11.019\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"605_CR52","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ergon.2008.05.001","volume":"39","author":"EJ Lodree","year":"2009","unstructured":"Lodree, E. J., Geiger, C. D., & Jiang, X. (2009). Taxonomy for integrating scheduling theory and human factors: Review and research opportunities. International Journal of Industrial Ergonomics,\n 39(1), 39\u201351. \n https:\/\/doi.org\/10.1016\/j.ergon.2008.05.001\n \n .","journal-title":"International Journal of Industrial Ergonomics"},{"issue":"2","key":"605_CR53","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1287\/opre.32.2.440","volume":"32","author":"I Meilijson","year":"1984","unstructured":"Meilijson, I., & Tamir, A. (1984). Minimizing flow time on parallel identical processors with variable unit processing time. Operations Research,\n 32(2), 440\u2013448. \n https:\/\/doi.org\/10.1287\/opre.32.2.440\n \n .","journal-title":"Operations Research"},{"issue":"3","key":"605_CR54","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0377-2217(02)00358-2","volume":"147","author":"G Mosheiov","year":"2003","unstructured":"Mosheiov, G., & Sidney, J. B. (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research,\n 147(3), 665\u2013670. \n https:\/\/doi.org\/10.1016\/S0377-2217(02)00358-2\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"19","key":"605_CR55","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1016\/j.ipl.2011.07.005","volume":"111","author":"D Oron","year":"2011","unstructured":"Oron, D. (2011). Scheduling a batching machine with convex resource consumption functions. Information Processing Letters,\n 111(19), 962\u2013967. \n https:\/\/doi.org\/10.1016\/j.ipl.2011.07.005\n \n .","journal-title":"Information Processing Letters"},{"key":"605_CR56","doi-asserted-by":"publisher","unstructured":"Pan, Y., & Shi, L. On the optimal solution of the general min\u2013max sequencing problem. In 2004 43rd IEEE conference on decision and control (CDC) (IEEE Cat. No.04CH37601), 17\u201317 December 2004 (Vol. 3, 3183, pp. 3189\u20133190). \n https:\/\/doi.org\/10.1109\/cdc.2004.1428964\n \n .","DOI":"10.1109\/cdc.2004.1428964"},{"issue":"3","key":"605_CR57","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0377-2217(97)00070-2","volume":"105","author":"V Reddy Dondeti","year":"1998","unstructured":"Reddy Dondeti, V., & Mohanty, B. B. (1998). Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs. European Journal of Operational Research,\n 105(3), 509\u2013524. \n https:\/\/doi.org\/10.1016\/S0377-2217(97)00070-2\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"605_CR58","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.omega.2013.05.005","volume":"42","author":"K Rustogi","year":"2014","unstructured":"Rustogi, K., & Strusevich, V. A. (2014). Combining time and position dependent effects on a single machine subject to rate-modifying activities. Omega,\n 42(1), 166\u2013178. \n https:\/\/doi.org\/10.1016\/j.omega.2013.05.005\n \n .","journal-title":"Omega"},{"issue":"08","key":"605_CR59","doi-asserted-by":"publisher","first-page":"457","DOI":"10.4236\/iim.2010.28056","volume":"2","author":"P Senthilkumar","year":"2010","unstructured":"Senthilkumar, P., & Narayanan, S. (2010). Literature review of single machine scheduling Problem with uniform parallel machines. Intelligent Information Management,\n 2(08), 457.","journal-title":"Intelligent Information Management"},{"issue":"1","key":"605_CR60","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ejor.2004.12.008","volume":"173","author":"D Shabtay","year":"2006","unstructured":"Shabtay, D., & Kaspi, M. (2006). Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research,\n 173(1), 92\u2013107. \n https:\/\/doi.org\/10.1016\/j.ejor.2004.12.008\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"13","key":"605_CR61","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics,\n 155(13), 1643\u20131666. \n https:\/\/doi.org\/10.1016\/j.dam.2007.02.003\n \n .","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"605_CR62","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/tsmcc.2006.874022","volume":"36","author":"W Shen","year":"2006","unstructured":"Shen, W., Wang, L., & Hao, Q. (2006). Agent-based distributed manufacturing process planning and scheduling: A state-of-the-art survey. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews),\n 36(4), 563\u2013577. \n https:\/\/doi.org\/10.1109\/tsmcc.2006.874022\n \n .","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)"},{"issue":"5","key":"605_CR63","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","volume":"28","author":"RG Vickson","year":"1980","unstructured":"Vickson, R. G. (1980a). Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Operations Research,\n 28(5), 1155\u20131167. \n https:\/\/doi.org\/10.1287\/opre.28.5.1155\n \n .","journal-title":"Operations Research"},{"issue":"3","key":"605_CR64","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"RG Vickson","year":"1980","unstructured":"Vickson, R. G. (1980b). Two single machine sequencing problems involving controllable job processing times. A I I E Transactions,\n 12(3), 258\u2013262. \n https:\/\/doi.org\/10.1080\/05695558008974515\n \n .","journal-title":"A I I E Transactions"},{"key":"605_CR65","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.omega .2018.07.005","volume":"83","author":"H Wang","year":"2019","unstructured":"Wang, H., & Alidaee, B. (2019). Effective heuristic for large-scale unrelated parallel machines scheduling problems. Omega,\n 83, 261\u2013274. \n https:\/\/doi.org\/10.1016\/j.omega.2018.07.005\n \n .","journal-title":"Omega"},{"issue":"4","key":"605_CR66","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.1109\/TASE.2018.2832440","volume":"15","author":"H Wang","year":"2018","unstructured":"Wang, H., & Alidaee, B. (2018). Unrelated parallel machine selection and job scheduling with the objective of minimizing total workload and machine fixed costs. IEEE Transactions on Automation Science and Engineering,\n 15(4), 1955\u20131963. \n https:\/\/doi.org\/10.1109\/TASE.2018.2832440\n \n .","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"3","key":"605_CR67","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2010.03.037","volume":"208","author":"J W\u0119glarz","year":"2011","unstructured":"W\u0119glarz, J., J\u00f3zefowska, J., Mika, M., & Walig\u00f3ra, G. (2011). Project scheduling with finite or infinite number of activity processing modes\u2014A survey. European Journal of Operational Research,\n 208(3), 177\u2013205. \n https:\/\/doi.org\/10.1016\/j.ejor.2010.03.037\n \n .","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"605_CR68","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger, G. J. (1997). A polynomial-time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters,\n 20(4), 149\u2013154. \n https:\/\/doi.org\/10.1016\/S0167-6377(96)00055-7\n \n .","journal-title":"Operations Research Letters"},{"issue":"2","key":"605_CR69","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.cor.2007.10.018","volume":"36","author":"W-H Yang","year":"2009","unstructured":"Yang, W.-H. (2009). Scheduling jobs on a single machine to maximize the total revenue of jobs. Computers & Operations Research,\n 36(2), 565\u2013583. \n https:\/\/doi.org\/10.1016\/j.cor.2007.10.018\n \n .","journal-title":"Computers & Operations Research"},{"issue":"1","key":"605_CR70","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TSMCA.2011.2147305","volume":"42","author":"Y Yin","year":"2012","unstructured":"Yin, Y., Liu, M., Hao, J., & Zhou, M. (2012). Single-machine scheduling with job-position-dependent learning and time-dependent deterioration. IEEE Transactions on Systems, Man, and Cybernetics\u2014Part A: Systems and Humans,\n 42(1), 192\u2013200. \n https:\/\/doi.org\/10.1109\/TSMCA.2011.2147305\n \n .","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics\u2014Part A: Systems and Humans"},{"issue":"3","key":"605_CR71","doi-asserted-by":"publisher","first-page":"365","DOI":"10.5267\/j.ijiec.2015.2.005","volume":"6","author":"R Yusriski","year":"2015","unstructured":"Yusriski, R., Sukoyo, S., Samadhi, T., & Halim, A. (2015). Integer batch scheduling problems for a single-machine with simultaneous effect of learning and forgetting to minimize total actual flow time. International Journal of Industrial Engineering Computations,\n 6(3), 365\u2013378.","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"605_CR72","doi-asserted-by":"publisher","unstructured":"Zhang, L., & Sun, R. An improvement of resource-constrained multi-project scheduling model based on priority-rule based heuristics. In ICSSSM11, 25\u201327 June 2011 (pp. 1\u20135). \n https:\/\/doi.org\/10.1109\/icsssm.2011.5959321\n \n .","DOI":"10.1109\/icsssm.2011.5959321"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00605-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-019-00605-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00605-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T00:14:46Z","timestamp":1585008886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-019-00605-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,25]]},"references-count":72,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["605"],"URL":"https:\/\/doi.org\/10.1007\/s10951-019-00605-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2019,3,25]]},"assertion":[{"value":"25 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}