{ "labelLang" : "hun", "responseDate" : "2024-03-29 16:52", "paging" : { "last" : true, "first" : true, "totalPages" : 1, "totalElements" : 1, "totalUncutElements" : 1, "totalEstimatedElements" : 1, "size" : 10, "number" : 1, "numberOfElements" : 1, "sort" : [ { "direction" : "DESC", "property" : "publishedYear", "ascending" : false }, { "direction" : "ASC", "property" : "firstAuthor", "ascending" : true } ] }, "content" : [ { "otype" : "JournalArticle", "mtid" : 2768363, "status" : "VALIDATED", "published" : true, "unhandledTickets" : 0, "oldTimestamp" : "2016-02-16T14:46:48.000+0000", "deleted" : false, "oldId" : 2768363, "lastRefresh" : "2024-02-17T17:12:11.512+0000", "lastModified" : "2023-11-13T08:37:47.590+0000", "created" : "2014-11-08T08:30:58.000+0000", "creator" : { "otype" : "Author", "mtid" : 10006953, "link" : "/api/author/10006953", "label" : "Galambos Gábor (Kombinatorika és gráfelmélet)", "familyName" : "Galambos", "givenName" : "Gábor", "published" : true, "oldId" : 10006953, "snippet" : true }, "lastDuplumOK" : "2023-11-13T08:37:40.542+0000", "lastDuplumSearch" : "2023-11-13T08:37:40.542+0000", "validated" : "2023-11-13T08:37:47.792+0000", "validator" : { "otype" : "Admin", "mtid" : 10073918, "link" : "/api/admin/10073918", "label" : "Kovács Marcell (MTMT Közp., admin)", "familyName" : "Kovács", "givenName" : "Marcell", "published" : true, "snippet" : true }, "tempLockers" : [ { "otype" : "Admin", "mtid" : 10063514, "link" : "/api/admin/10063514", "label" : "Mikola Katalin (MTMT 3, admin)", "familyName" : "Mikola", "givenName" : "Katalin", "published" : true, "oldId" : 10063514, "snippet" : true } ], "tempLocked" : "2022-05-05T13:04:33.992+0000", "core" : true, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000059, "link" : "/api/subtype/10000059", "label" : "Szakcikk (Folyóiratcikk)", "name" : "Szakcikk", "nameEng" : "Article", "docType" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "listPosition" : 101, "published" : true, "oldId" : 10000059, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Békési, J", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 5566653, "link" : "/api/authorship/5566653", "label" : "Békési, J [Békési, József (Kombinatorikus op...), szerző] Informatika Alkalmazásai Tanszék (SZTE / JGYPK / SZFTI)", "listPosition" : 1, "share" : 0.25, "first" : true, "last" : false, "author" : { "otype" : "Author", "mtid" : 10000575, "link" : "/api/author/10000575", "label" : "Békési József (Kombinatorikus optimalizálás, operációkutatás)", "familyName" : "Békési", "givenName" : "József", "published" : true, "oldId" : 10000575, "snippet" : true }, "familyName" : "Békési", "givenName" : "J", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 20452174, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 5566654, "link" : "/api/authorship/5566654", "label" : "Galambos, G [Galambos, Gábor (Kombinatorika és ...), szerző] Informatika Alkalmazásai Tanszék (SZTE / JGYPK / SZFTI)", "listPosition" : 2, "share" : 0.25, "first" : false, "last" : false, "author" : { "otype" : "Author", "mtid" : 10006953, "link" : "/api/author/10006953", "label" : "Galambos Gábor (Kombinatorika és gráfelmélet)", "familyName" : "Galambos", "givenName" : "Gábor", "published" : true, "oldId" : 10006953, "snippet" : true }, "familyName" : "Galambos", "givenName" : "G", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 20452173, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 5566655, "link" : "/api/authorship/5566655", "label" : "Jung, M N", "listPosition" : 3, "share" : 0.25, "first" : false, "last" : false, "familyName" : "Jung", "givenName" : "M N", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 20452172, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 101590480, "link" : "/api/authorship/101590480", "label" : "Oswald, M.", "listPosition" : 4, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Oswald", "givenName" : "M.", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 101590481, "link" : "/api/authorship/101590481", "label" : "Reinelt, G ✉", "listPosition" : 5, "share" : 0.0, "first" : false, "last" : true, "corresponding" : true, "familyName" : "Reinelt", "givenName" : "G", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "snippet" : true } ], "title" : "A branch-and-bound algorithm for the coupled task problem", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 909241, "link" : "/api/publicationidentifier/909241", "label" : "DOI: 10.1007/s00186-014-0469-6", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "10.1007/s00186-014-0469-6", "realUrl" : "https://doi.org/10.1007/s00186-014-0469-6", "published" : false, "oldId" : 1307668, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 909239, "link" : "/api/publicationidentifier/909239", "label" : "WoS: 000340499300003", "source" : { "otype" : "PlainSource", "mtid" : 1, "link" : "/api/publicationsource/1", "label" : "WoS", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "WoS", "nameEng" : "WoS", "linkPattern" : "https://www.webofscience.com/wos/woscc/full-record/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 1, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "000340499300003", "realUrl" : "https://www.webofscience.com/wos/woscc/full-record/000340499300003", "published" : false, "oldId" : 1307667, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 909240, "link" : "/api/publicationidentifier/909240", "label" : "Scopus: 84906789217", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "oaFree" : false, "validState" : "IDENTICAL", "idValue" : "84906789217", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84906789217", "published" : false, "oldId" : 1306510, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 24786137, "link" : "/api/publicationidentifier/24786137", "label" : "SZTE Publicatio: 28681", "source" : { "otype" : "SwordSource", "mtid" : 90, "link" : "/api/publicationsource/90", "label" : "SZTE Publicatio", "type" : { "otype" : "PublicationSourceType", "mtid" : 10007, "link" : "/api/publicationsourcetype/10007", "label" : "Repozitórium", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "SZTE Publicatio", "nameEng" : "SZTE Publicatio", "linkPattern" : "http://publicatio.bibl.u-szeged.hu/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 90, "snippet" : true }, "oaType" : "GREEN", "oaFree" : true, "validState" : "IDENTICAL", "idValue" : "28681", "realUrl" : "http://publicatio.bibl.u-szeged.hu/28681", "published" : false, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 24817, "link" : "/api/journal/24817", "label" : "MATHEMATICAL METHODS OF OPERATIONS RESEARCH 1432-2994 1432-5217", "pIssn" : "1432-2994", "eIssn" : "1432-5217", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : true, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 24817, "snippet" : true }, "volume" : "80", "issue" : "1", "firstPage" : "47", "lastPage" : "81", "firstPageOrInternalIdForSort" : "47", "pageLength" : 35, "publishedYear" : 2014, "abstractText" : "The coupled task problem is to schedule jobs on a single machine where each job consists of two subtasks and where the second subtask has to be started after a given time interval with respect to the first one. The problem has several applications and is NP-hard. In this paper we present a branch-and-bound algorithm for this problem and compare its performance with four integer programming models.", "subjects" : [ { "otype" : "Classification", "mtid" : 10003, "link" : "/api/classification/10003", "label" : "Matematika", "published" : true, "snippet" : true }, { "otype" : "Classification", "mtid" : 10034, "link" : "/api/classification/10034", "label" : "Számítás- és információtudomány", "published" : true, "snippet" : true } ], "digital" : null, "printed" : null, "sourceYear" : 2014, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : false, "nationalOrigin" : true, "missingAuthor" : false, "oaType" : "GREEN", "oaCheckDate" : "2024-02-17", "oaFree" : true, "oaLink" : "http://publicatio.bibl.u-szeged.hu/28681", "citationCount" : 9, "citationCountUnpublished" : 0, "citationCountWoOther" : 7, "independentCitCountWoOther" : 7, "nationalOriginCitationCount" : 0, "foreignEditionCitationCount" : 8, "doiCitationCount" : 6, "wosCitationCount" : 5, "scopusCitationCount" : 6, "wosScopusCitationCount" : 7, "wosScopusCitationCountWoOther" : 7, "wosScopusIndependentCitationCount" : 7, "wosScopusIndependentCitationCountWoOther" : 7, "independentCitationCount" : 9, "selfCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 9, "independentCitingPubCount" : 9, "citingPubCountWoOther" : 7, "independentCitingPubCountWoOther" : 7, "unhandledCitingPubCount" : 0, "citedPubCount" : 1, "citedCount" : 1, "ratings" : [ { "otype" : "MtaRating", "mtid" : 508108, "link" : "/api/mtarating/508108", "label" : "IX. Gazdaságtudományi Doktori Minősítő Bizottság:B nemzetközi MATHEMATICAL METHODS OF OPERATIONS RESEARCH 1432-2994 1432-5217", "ratingType" : { "otype" : "RatingType", "mtid" : 10012, "link" : "/api/ratingtype/10012", "label" : "IX. Gazdaságtudományi Doktori Minősítő Bizottság", "code" : "GMB", "institute" : { "otype" : "Institute", "mtid" : 19066, "link" : "/api/institute/19066", "label" : "Gazdaságtudományi Doktori Minősítő Bizottság IXGJO GMB [1901-]", "childrenCount" : 0, "allowInstForum" : false, "allowOnlineRegistration" : true, "name" : "Gazdaságtudományi Doktori Minősítő Bizottság", "nameEng" : "Gazdaságtudományi Doktori Minősítő Bizottság", "published" : true, "oldId" : 19066, "snippet" : true }, "published" : true, "snippet" : true }, "val" : "B nemzetközi", "published" : true, "oldId" : 8108, "snippet" : true }, { "otype" : "SjrRating", "mtid" : 11089987, "link" : "/api/sjrrating/11089987", "label" : "sjr:Q2 (2014) Scopus - Management Science and Operations Research MATHEMATICAL METHODS OF OPERATIONS RESEARCH 1432-2994 1432-5217", "listPos" : 54, "rankValue" : 0.49, "type" : "journal", "ratingType" : { "otype" : "RatingType", "mtid" : 10002, "link" : "/api/ratingtype/10002", "label" : "sjr", "code" : "sjr", "published" : true, "snippet" : true }, "subject" : { "otype" : "ClassificationExternal", "mtid" : 1803, "link" : "/api/classificationexternal/1803", "label" : "Scopus - Management Science and Operations Research", "published" : true, "oldId" : 1803, "snippet" : true }, "ranking" : "Q2", "calculation" : "DIRECT", "published" : true, "snippet" : true } ], "ratingsForSort" : "Q2", "mtaRatingsForSort" : "B nemzetközi", "hasCitationDuplums" : false, "userChangeableUntil" : "2016-02-16T14:46:48.000+0000", "publishDate" : "2015-02-02T06:25:21.000+0000", "directInstitutesForSort" : "Informatika Alkalmazásai Tanszék (SZTE / JGYPK / SZFTI)", "ownerAuthorCount" : 2, "ownerInstituteCount" : 8, "directInstituteCount" : 1, "authorCount" : 5, "contributorCount" : 0, "hasQualityFactor" : true, "tempLockerIds" : [ 10063514 ], "link" : "/api/publication/2768363", "label" : "Békési J et al. A branch-and-bound algorithm for the coupled task problem. (2014) MATHEMATICAL METHODS OF OPERATIONS RESEARCH 1432-2994 1432-5217 80 1 47-81", "template" : "