{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T08:57:27Z","timestamp":1781341047614,"version":"3.54.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,4,13]],"date-time":"2013-04-13T00:00:00Z","timestamp":1365811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10951-013-0327-z","type":"journal-article","created":{"date-parts":[[2013,4,12]],"date-time":"2013-04-12T04:23:50Z","timestamp":1365740630000},"page":"519-527","source":"Crossref","is-referenced-by-count":9,"title":["Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times"],"prefix":"10.1007","volume":"16","author":[{"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dvir","family":"Shabtay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,4,13]]},"reference":[{"key":"327_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"EM Arkin","year":"1987","unstructured":"Arkin, E. M., & Silverberg, E. L. (1987). Scheduling jobs with fixed start and finish times. Discrete Applied Mathematics, 18, 1\u20138.","journal-title":"Discrete Applied Mathematics"},{"issue":"22\u201336","key":"327_CR2","first-page":"32","volume":"38","author":"KR Baker","year":"1990","unstructured":"Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: A review. Operations Research, 38(22\u201336), 32.","journal-title":"Operations Research"},{"key":"327_CR3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1057\/palgrave.jors.2601689","volume":"55","author":"A Bachman","year":"2004","unstructured":"Bachman, A., & Janiak, A. (2004). Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society, 55, 257\u2013264.","journal-title":"Journal of the Operational Research Society"},{"key":"327_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173\u2013178.","journal-title":"European Journal of Operational Research"},{"key":"327_CR5","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00121680","volume":"9","author":"KI Bouzina","year":"1996","unstructured":"Bouzina, K. I., & Emmonss, H. (1996). Interval scheduling on identical machines. Journal of Global Optimization, 9, 379\u2013393.","journal-title":"Journal of Global Optimization"},{"key":"327_CR6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","volume":"59","author":"MC Carlisle","year":"1995","unstructured":"Carlisle, M. C., & Lloyd, E. L. (1995). On the $$k$$ k -coloring of intervals. Discrete Applied Mathematics, 59, 225\u2013235.","journal-title":"Discrete Applied Mathematics"},{"key":"327_CR7","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/S0377-2217(01)00068-6","volume":"136","author":"Z-L Chen","year":"2002","unstructured":"Chen, Z.-L., & Lee, C.-Y. (2002). Parallel machine scheduling with a common due window. European Journal of Operational Research, 136, 512\u2013527.","journal-title":"European Journal of Operational Research"},{"key":"327_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10951-007-0030-z","volume":"10","author":"BC Choi","year":"2007","unstructured":"Choi, B. C., & Yoon, S. H. (2007). Maximizing the weighted number of just-in-time jobs in flow shop scheduling. Journal of Scheduling, 10, 237\u2013243.","journal-title":"Journal of Scheduling"},{"key":"327_CR9","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1016\/j.cor.2004.05.011","volume":"32","author":"O \u010cepek","year":"2005","unstructured":"\u010cepek, O., & Sung, S. C. (2005). A Quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers and Operations Research, 32, 3265\u20133271.","journal-title":"Computers and Operations Research"},{"key":"327_CR10","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman and Co."},{"key":"327_CR11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals Discrete Mathematics"},{"key":"327_CR12","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1057\/jors.2008.184","volume":"61","author":"R-H Huang","year":"2010","unstructured":"Huang, R.-H., Yang, C.-L., & Huang, H.-T. (2010). Parallel machine scheduling with common due windows. Journal of the Operational Research Society, 61, 640\u2013646.","journal-title":"Journal of the Operational Research Society"},{"issue":"7","key":"327_CR13","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/S0305-0548(00)00086-1","volume":"29","author":"K Hiraishi","year":"2002","unstructured":"Hiraishi, K., Levner, E., & Vlach, M. (2002). Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Computers and Operations Research, 29(7), 841\u2013848.","journal-title":"Computers and Operations Research"},{"key":"327_CR14","unstructured":"Janiak, A., & Marek, M. (2004). Parallel processor scheduling problems with optimal due interval assignment. In Proceedings of the 5th Mexican International Conference in Computer Science (ENC\u201904) (pp. 383\u2013387). New York: IEEE Press."},{"key":"327_CR15","unstructured":"Janiak, A., & Marek, M. (2004). Property of symmetry for some single processor scheduling problems with due interval assignment. Systems Science, 30, 4."},{"key":"327_CR16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-27679-3_27","volume":"2004","author":"A Janiak","year":"2005","unstructured":"Janiak, A., & Winczaszek, M. (2005). A single processor scheduling problem with common due window assignment. Operations Research Proceedings, 2004, 213\u2013220.","journal-title":"Operations Research Proceedings"},{"key":"327_CR17","doi-asserted-by":"crossref","unstructured":"Janiak, A., & Winczaszek, M. (2006). Common due window assignment in parallel processor scheduling problem with nonlinear penalty functions. Lecture Notes in Computer Science (pp. 132\u2013139).","DOI":"10.1007\/11752578_17"},{"key":"327_CR18","doi-asserted-by":"crossref","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, Part A: Systems and Humans, 37, 614\u2013620.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans"},{"key":"327_CR19","doi-asserted-by":"crossref","first-page":"209","DOI":"10.4064\/ba57-3-3","volume":"57","author":"A Janiak","year":"2009","unstructured":"Janiak, A., Janiak, W. A., & Januszkiewicz, R. (2009). Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs. Bulletin of the Polish Academy of Sciences: Technical Sciences, 57, 209\u2013215.","journal-title":"Bulletin of the Polish Academy of Sciences: Technical Sciences"},{"issue":"6","key":"327_CR20","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1057\/jors.2009.30","volume":"61","author":"A Janiak","year":"2010","unstructured":"Janiak, A., & Rudek, R. (2010). Scheduling jobs under an aging effect. Journal of the Operational Research Society, 61(6), 1041\u20131048.","journal-title":"Journal of the Operational Research Society"},{"key":"327_CR21","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0895-7177(97)00074-5","volume":"25","author":"C Koulamas","year":"1997","unstructured":"Koulamas, C. (1997). Maximizing the weighted number of on-time jobs in a single machine scheduling with time windows. Mathematical Computer Modelling, 25, 57\u201362.","journal-title":"Mathematical Computer Modelling"},{"key":"327_CR22","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A Lann","year":"1996","unstructured":"Lann, A., & Mosheiov, G. (1996). Single machine scheduling to minimize the number of early and tardy jobs. Computers and Operations Research, 23, 765\u2013781.","journal-title":"Computers and Operations Research"},{"key":"327_CR23","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1057\/palgrave.jors.2601215","volume":"52","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov, G. (2001). Parallel machine scheduling with a learning effect. Journal of the Operational Research Society, 52, 1165\u20131169.","journal-title":"Journal of the Operational Research Society"},{"key":"327_CR24","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1002\/nav.20039","volume":"51","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov, G., & Oron, D. (2004). Due-window assignment with unit processing-time jobs. Naval Research Logistics, 51, 1005\u20131007.","journal-title":"Naval Research Logistics"},{"key":"327_CR25","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1057\/palgrave.jors.2601809","volume":"56","author":"G Mosheiov","year":"2005","unstructured":"Mosheiov, G., & Sidney, J. (2005). Note on scheduling with general learning curves to minimize the number of tardy jobs. Journal of the Operational Research Society, 56, 110\u2013112.","journal-title":"Journal of the Operational Research Society"},{"key":"327_CR26","doi-asserted-by":"crossref","unstructured":"Shabtay, D., & Bensusan, Y. (2012). Maximizing the weighted number of just-in time jobs in a two machine flow and open shop scheduling systems. Journal of Scheduling, 15(1), 39\u201347.","DOI":"10.1007\/s10951-010-0204-y"},{"key":"327_CR27","doi-asserted-by":"crossref","unstructured":"Shabtay, D. (2012). The just-in-time scheduling problem in a flow-shop scheduling system. European Journal of Operational Research, 216(3), 521\u2013532.","DOI":"10.1016\/j.ejor.2011.07.053"},{"key":"327_CR28","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","volume":"8","author":"SC Sung","year":"2005","unstructured":"Sung, S. C., & Vlach, M. (2005). Maximizing weighted number of just-in-time jobs on unrelated parallel machines. Journal of Scheduling, 8, 453\u2013460.","journal-title":"Journal of Scheduling"},{"key":"327_CR29","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0305-0548(99)00097-0","volume":"28","author":"WK Yeung","year":"2001","unstructured":"Yeung, W. K., Oguz, C., & Cheng, T. C. E. (2001). Single-machine scheduling with a common due window. Computers & Operations Research, 28, 157\u2013175.","journal-title":"Computers & Operations Research"},{"key":"327_CR30","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1002\/nav.20356","volume":"56","author":"WK Yeung","year":"2009","unstructured":"Yeung, W. K., Oguz, C., & Cheng, T. C. E. (2009). Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs. Naval Research Logistics, 56, 593\u2013599.","journal-title":"Naval Research Logistics"},{"key":"327_CR31","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0360-8352(01)00012-2","volume":"39","author":"W-S Yoo","year":"2001","unstructured":"Yoo, W.-S., & Martin-Vega, L. A. (2001). Scheduling single-machine problems for on-time delivery. Computers & Industrial Engineering, 39, 371\u2013392.","journal-title":"Computers & Industrial Engineering"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0327-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0327-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0327-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:48Z","timestamp":1559468388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0327-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,13]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["327"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0327-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,13]]}}}