{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:57:57Z","timestamp":1764687477706,"version":"3.41.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1023\/a:1022908509269","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T22:16:51Z","timestamp":1049753811000},"page":"287-307","source":"Crossref","is-referenced-by-count":15,"title":["Scheduling with Conflicts on Bipartite and Interval Graphs"],"prefix":"10.1007","volume":"6","author":[{"given":"Sandy","family":"Irani","sequence":"first","affiliation":[]},{"given":"Vitus","family":"Leung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5117217_CR1","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0360-8352(96)00201-X","volume":"34","author":"H. M. Al-Deek","year":"1998","unstructured":"Al-Deek, H. M., S. S. Ishak, and A. E. Radwan, \u201cImpact of traffic diversion with ATIS on travelers' safety,\u201d Comput. Indust. Eng., 34, 547-558 (1998).","journal-title":"Comput. Indust. Eng."},{"key":"5117217_CR2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0968-090X(93)90004-Y","volume":"1","author":"H. M. Al-Deek","year":"1993","unstructured":"Al-Deek, H. M. and A. Kanafani, \u201cModeling the benefits of advanced traveler information systems in corridors with incidents,\u201d Transportation Res. Part C, 1, 303-324 (1993).","journal-title":"Transportation Res. Part C"},{"issue":"3","key":"5117217_CR3","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, \u201cOn-line routing of virtual circuits with applications to load balancing and machine scheduling,\u201d JACM, 44(3), 486-504 (May 1997).","journal-title":"JACM"},{"key":"5117217_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(96)00031-X","volume":"162","author":"B. S. Baker","year":"1996","unstructured":"Baker, B. S. and E. G. Coffman, Jr., \u201cMutual exclusion scheduling,\u201d Theoret. Comput. Sci., 162, 225-243 (1996).","journal-title":"Theoret. Comput. Sci."},{"key":"5117217_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-56188-9_19","volume-title":"Proc. 6th Int. Workshop on Distributed Algorithms","author":"J. Bar-Ilan","year":"1992","unstructured":"Bar-Ilan, J. and D. Peleg, \u201cDistributed resource allocation algorithms,\u201d in A. Segall S. Zaks (eds.), Proc. 6th Int. Workshop on Distributed Algorithms, Springer-Verlag, New York, 1992, pp. 277-291."},{"issue":"4","key":"5117217_CR6","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/S0097539795282092","volume":"27","author":"A. Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., A. Mayer, B. Schieber, and M. Sudan, \u201cGuaranteeing fair service to persistent dependent tasks,\u201d SIAM J. Comput., 27(4), 1168-1189 (August 1998).","journal-title":"SIAM J. Comput."},{"key":"5117217_CR7","first-page":"291","volume-title":"Mathematical Foundations of Computer Science","author":"H. L. Bodlaender","year":"1993","unstructured":"Bodlaender, H. L. and K. Jansen, \u201cOn the complexity of scheduling incompatible jobs with unit-times,\u201d in A. M. Borzyszkowski S. Sokolowski (eds.), Mathematical Foundations of Computer Science, Springer-Verlag, Berlin, 1993, pp. 291-300."},{"key":"5117217_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0166-218X(94)90009-4","volume":"55","author":"H. L. Bodlaender","year":"1994","unstructured":"Bodlaender, H. L., K. Jansen, and G. J. Woeginger, \u201cScheduling with incompatible jobs,\u201d Discrete Appl. Math., 55, 219-232 (1994).","journal-title":"Discrete Appl. Math."},{"key":"5117217_CR9","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A. and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, New York, 1998."},{"key":"5117217_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/87.317982","volume":"2","author":"D. Bullock","year":"1994","unstructured":"Bullock, D. and C. Hendrickson, \u201cRoadway traffic control software,\u201d IEEE Trans. Control Syst. Tech., 2, 255-264 (1994).","journal-title":"IEEE Trans. Control Syst. Tech."},{"key":"5117217_CR11","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K. Chandy","year":"1984","unstructured":"Chandy, K. and J. Misra, \u201cThe drinking philosophers problem,\u201d ACM Trans. Programming Lang. Syst., 6, 632-646 (1984).","journal-title":"ACM Trans. Programming Lang. Syst."},{"key":"5117217_CR12","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1109\/49.245907","volume":"11","author":"J. Chen","year":"1993","unstructured":"Chen, J., I. Cidon, and Y. Ofek, \u201cA local fairness algorithm for gigabit LANs\/MANs with spatial reuse,\u201d IEEE J. Selected Areas Comm., 11, 1183-1192 (1993).","journal-title":"IEEE J. Selected Areas Comm."},{"issue":"3","key":"5117217_CR13","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1145\/203095.203101","volume":"17","author":"M. Choy","year":"1995","unstructured":"Choy, M., and A. K. Singh, \u201cEfficient fault-tolerant algorithms for distributed resource allocation,\u201d ACM Trans. on Programming Lang. Syst., 17(3), 535-559 (May 1995).","journal-title":"ACM Trans. on Programming Lang. Syst."},{"key":"5117217_CR14","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1017\/S0269964899134016","volume":"13","author":"E. G. Coffman Jr.","year":"1999","unstructured":"Coffman, E. G., Jr., A. Feldmann, N. Kahale, and B. Poonen, \u201cComputing call admission capacities in linear networks,\u201d Prob. Eng. Inf. Sci., 13, 387-406 (1999).","journal-title":"Prob. Eng. Inf. Sci."},{"issue":"3","key":"5117217_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/340242.340263","volume":"27","author":"E. G. Coffman Jr.","year":"1999","unstructured":"Coffman, E. G., Jr., P. Robert, and A. L. Stolyar, \u201cThe interval packing process of linear networks,\u201d Performance Evaluation Rev., 27(3), 3-4 (December 1999).","journal-title":"Performance Evaluation Rev."},{"key":"5117217_CR16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E. W. Dijkstra","year":"1971","unstructured":"Dijkstra, E. W., \u201cHierarchical ordering of sequential processes,\u201d Acta Inform., 1, 115-138 (1971).","journal-title":"Acta Inform."},{"issue":"6","key":"5117217_CR17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/37.334411","volume":"14","author":"R. E. Fenton","year":"1994","unstructured":"Fenton, R. E., \u201cIVHS\/AHS: driving into the future,\u201d IEEE Control Syst. Mag., 14(6), 13-20 (December 1994).","journal-title":"IEEE Control Syst. Mag."},{"key":"5117217_CR18","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"key":"5117217_CR19","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1142\/S0129054193000183","volume":"4","author":"K. Jansen","year":"1993","unstructured":"Jansen, K., \u201cScheduling of incompatible jobs on unrelated machines,\u201d Int. J. Found. Comput. Sci., 4, 275-291 (1993).","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5117217_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M., \u201cReducibility among combinatorial problems,\u201d in R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum, New York, 1972, pp. 85-103."},{"key":"5117217_CR21","first-page":"101","volume":"27","author":"A. J. Khattak","year":"1993","unstructured":"Khattak, A. J., J. L. Schofer, and F. S. Koppelman, \u201cCommuters' enroute diversion and return decisions: analysis and implications for advanced traveler information systems,\u201d Transportation Res. Part A, 27, 101-111 (1993).","journal-title":"Transportation Res. Part A"},{"key":"5117217_CR22","first-page":"394","volume-title":"Proc. 35th Symp. on the Foundations of Computer Science","author":"E. Koutsoupias","year":"1994","unstructured":"Koutsoupias, E. and C. H. Papadimitriou, \u201cBeyond competitive analysis,\u201d in Proc. 35th Symp. on the Foundations of Computer Science, IEEE Computer Society, Washington, DC, 1994, pp. 394-400."},{"issue":"5","key":"5117217_CR23","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C. and M. Yannakakis, \u201cOn the hardness of approximating minimization problem,\u201d J. Assoc. Comput. Machinery, 41(5), 960-981 (September 1994).","journal-title":"J. Assoc. Comput. Machinery"},{"key":"5117217_CR24","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(81)90015-5","volume":"23","author":"N. Lynch","year":"1981","unstructured":"Lynch, N., \u201cUpper bounds for static resource allocation in a distributed system,\u201d J. Comput. Syst. Sci., 23, 254-278 (1981).","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"5117217_CR25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., S. Phillips, and E. Torng, \u201cNon-clairvoyant scheduling,\u201d Theor. Comput. Sci., 130(1), 17-47 (August 1994).","journal-title":"Theor. Comput. Sci."},{"key":"5117217_CR26","doi-asserted-by":"crossref","first-page":"501","DOI":"10.2140\/pjm.1970.34.501","volume":"34","author":"P. L. Renz","year":"1970","unstructured":"Renz, P. L., \u201cIntersection representations of graphs by arcs,\u201d Pacific J. Math., 34, 501-510 (1970).","journal-title":"Pacific J. Math."},{"key":"5117217_CR27","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(96)00042-X","volume":"72","author":"M. W. Schaffter","year":"1997","unstructured":"Schaffter, M. W., \u201cScheduling with forbidden sets,\u201d Discrete Appl. Math., 72, 155-166 (1997).","journal-title":"Discrete Appl. Math."},{"key":"5117217_CR28","volume-title":"Traffic Signal Settings","author":"F. V. Webster","year":"1958","unstructured":"Webster, F. V., Traffic Signal Settings, Her Majesty's Stationery Office, London, 1958."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022908509269.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022908509269\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022908509269.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:53:37Z","timestamp":1751633617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022908509269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["5117217"],"URL":"https:\/\/doi.org\/10.1023\/a:1022908509269","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}