{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:38:18Z","timestamp":1648791498988},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T00:00:00Z","timestamp":1259884800000},"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":[[2010,10]]},"DOI":"10.1007\/s10951-009-0139-3","type":"journal-article","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T23:54:10Z","timestamp":1259884450000},"page":"479-492","source":"Crossref","is-referenced-by-count":3,"title":["Makespan minimization of multi-slot just-in-time scheduling on\u00a0single and parallel machines"],"prefix":"10.1007","volume":"13","author":[{"given":"Dariusz","family":"Dereniowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wies\u0142aw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,4]]},"reference":[{"key":"139_CR1","doi-asserted-by":"crossref","unstructured":"Barth, D., Cohen, J., Gastal, L., Mautor, T., & Rousseau, S. (2004). Fixed size and variable size packet models in an optical ring network: complexity and simulations. In ISCIS (pp.\u00a0238\u2013246).","DOI":"10.1007\/978-3-540-30182-0_25"},{"issue":"1\u20133","key":"139_CR2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","volume":"100","author":"M. Bir\u00f3","year":"1992","unstructured":"Bir\u00f3, M., Hujter, M., & Tuza, Zs. (1992). Precoloring extension. i: interval graphs. Discrete Mathematics, 100(1\u20133), 267\u2013279.","journal-title":"Discrete Mathematics"},{"key":"139_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling computer and manufacturing processes","author":"J. B\u0142a\u017cewicz","year":"1996","unstructured":"B\u0142a\u017cewicz, J., Ecker, K., Pesch, E., Schmidt, G., & W\u0119glarz, J. (1996). Scheduling computer and manufacturing processes. New York: Springer."},{"key":"139_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","volume":"59","author":"M. C. Carlisle","year":"1995","unstructured":"Carlisle, M. C., & Lloyd, E. L. (1995). On the k-coloring of intervals. Discrete Applied Mathematics, 59, 225\u2013235.","journal-title":"Discrete Applied Mathematics"},{"key":"139_CR5","first-page":"431","volume":"10","author":"O. \u010cepek","year":"2004","unstructured":"\u010cepek, O., & Sung, S.-Ch. (2004). Just-in-time scheduling with periodic time slots. Scientiae Mathematicae Japonicae Online, 10, 431\u2013437.","journal-title":"Scientiae Mathematicae Japonicae Online"},{"issue":"5","key":"139_CR6","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1093\/ietfec\/e88-a.5.1192","volume":"E88-A","author":"E. Chiba","year":"2005","unstructured":"Chiba, E., & Hiraishi, K. (2005). A heuristic algorithm for one-machine just-in-time scheduling problem with periodic time slots. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, E88-A(5), 1192\u20131199.","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science"},{"issue":"5","key":"139_CR7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P. C. Gilmore","year":"1964","unstructured":"Gilmore, P. C., & Gomory, R. E. (1964). Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Operations Research, 12(5), 655\u2013679.","journal-title":"Operations Research"},{"issue":"2","key":"139_CR8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2), 416\u2013429.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"139_CR9","unstructured":"Hiraishi, K. (2001). Just-in-time scheduling of parallel identical machines with multiple time slots. In Proceedings of the 4th Czech\u2013Japan seminar on data analysis and decision making under uncertainty, Jindrichuv Hradec."},{"issue":"7","key":"139_CR10","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":"139_CR11","volume-title":"Just-in-time scheduling","author":"J. J\u00f3zefowska","year":"2007","unstructured":"J\u00f3zefowska, J. (2007). Just-in-time scheduling. New York: Springer."},{"key":"139_CR12","volume-title":"Proportional optimization and fairness","author":"W. Kubiak","year":"2009","unstructured":"Kubiak, W. (2009). Proportional optimization and fairness. New York: Springer."},{"issue":"3","key":"139_CR13","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/S0097539703434966","volume":"36","author":"A. Kumar","year":"2006","unstructured":"Kumar, A., & Kleinberg, J. (2006). Fairness measures for resource allocation. SIAM Journal on Computing, 36(3), 657\u2013680.","journal-title":"SIAM Journal on Computing"},{"key":"139_CR14","volume-title":"The travelling salesman problem","author":"E. L. Lawler","year":"1985","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1985). The travelling salesman problem. New York: Wiley."},{"key":"139_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N. Megiddo","year":"1974","unstructured":"Megiddo, N. (1974). Optimal flows in networks with multiple sources and sinks. Mathematical Programming, 7, 97\u2013107.","journal-title":"Mathematical Programming"},{"key":"139_CR16","unstructured":"Sung, S.-Ch., \u010cepek, O., & Hiraishi, K. (2007a). Algorithm for multislot just-in-time scheduling. In ISME\u201907: international symposium on management engineering."},{"key":"139_CR17","first-page":"120","volume-title":"ICICIC\u201907: Proceedings of the second international conference on innovative computing, information and control","author":"S.-Ch. Sung","year":"2007","unstructured":"Sung, S.-Ch., \u010cepek, O., & Hiraishi, K. (2007b). Algorithm for multislot just-in-time scheduling on identical parallel machines. In ICICIC\u201907: Proceedings of the second international conference on innovative computing, information and control, Washington, DC, USA (p.\u00a0120). Los Alamitos: IEEE Computer Society."},{"issue":"6","key":"139_CR18","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1023\/A:1026200209386","volume":"6","author":"G. L. Vairaktarakis","year":"2003","unstructured":"Vairaktarakis, G. L. (2003). Simple algorithms for Gilmore\u2013Gomory\u2019s traveling salesman and related problems. Journal of Scheduling, 6(6), 499\u2013520.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0139-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0139-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0139-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:43Z","timestamp":1559468383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0139-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,4]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["139"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0139-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,4]]}}}