{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:01:05Z","timestamp":1778587265651,"version":"3.51.4"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6041,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0166-218x(96)00040-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"115-139","source":"Crossref","is-referenced-by-count":29,"title":["Algorithms for minclique scheduling problems"],"prefix":"10.1016","volume":"72","author":[{"given":"Bernd","family":"Jurisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wieslaw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joanna","family":"Jozefowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00040-6_BIB1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0603056","article-title":"An algorithm for partitioning the nodes of a graph","volume":"3","author":"Barnes","year":"1982","journal-title":"SIAM J. Algebra Discrete Math."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB2","series-title":"Progress in Combinatorial Optimization","first-page":"13","article-title":"Partitioning, spectra, and linear programming","author":"Barnes","year":"1984"},{"key":"10.1016\/S0166-218X(96)00040-6_BIB3","first-page":"240","article-title":"Time bound on selection","volume":"7","author":"Blum","year":"1972","journal-title":"J. Comput. and System Sci."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0305-0548(90)90011-U","article-title":"CON due-date determination and sequencing","volume":"17","author":"De","year":"1990","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB5","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1287\/opre.40.6.1148","article-title":"On the minimization of completion time variance with bi-criteria extension","volume":"40","author":"De","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB6","article-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00040-6_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","article-title":"A user's guide to Tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB8","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/ijoc.5.2.97","article-title":"Constrained nonlinear 0\u20131 programming","volume":"5","author":"Hansen","year":"1993","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB10","series-title":"Matrix Analysis","author":"Horn","year":"1985"},{"key":"10.1016\/S0166-218X(96)00040-6_BIB11","article-title":"Spectral algorithms for the completion time variance problem","author":"J\u00f3zefowska","year":"1993"},{"key":"10.1016\/S0166-218X(96)00040-6_BIB12","first-page":"111","article-title":"SWEAT-a program for scheduling with earliness and tardiness penalties","volume":"43","author":"Kahlbacher","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB13","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","article-title":"Minimizing variation of flow time in single machine systems","volume":"27","author":"J Kanet","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB14","article-title":"The differencing method of set partitioning","author":"Karmakar","year":"1982"},{"key":"10.1016\/S0166-218X(96)00040-6_BIB15","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0166-218X(96)00040-6_BIB16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(93)E0125-I","article-title":"New results on the completion time variance minimization","volume":"58","author":"Kubiak","year":"1995","journal-title":"Discrete Applied Math."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","article-title":"Completion time variance minimization on a single machine is difficult","volume":"14","author":"Kubiak","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and machine scheduling problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB19","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(96)00040-6_BIB20","author":"Martello","year":"1990"},{"key":"10.1016\/S0166-218X(96)00040-6_BIB21","series-title":"Eigenvalues in combinatorial optimization","author":"Mohar","year":"1992"},{"key":"10.1016\/S0166-218X(96)00040-6_BIB22","doi-asserted-by":"crossref","DOI":"10.1007\/BF02032130","article-title":"A projection technique for partitioning the nodes of a graph","author":"Rendl","year":"1990"},{"key":"10.1016\/S0166-218X(96)00040-6_BIB23","first-page":"295","article-title":"Various optimizers for single-stage production","volume":"18","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quart."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000406?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000406?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:12Z","timestamp":1556666772000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0166218X96000406"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00040-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}