{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:21:44Z","timestamp":1747545704255},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6171,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0004-3702(95)00094-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:46:00Z","timestamp":1027593960000},"page":"43-73","source":"Crossref","is-referenced-by-count":10,"title":["Graph search methods for non-order-preserving evaluation functions: applications to job sequencing problems"],"prefix":"10.1016","volume":"86","author":[{"given":"Anup K.","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitava","family":"Bagchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00094-1_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322358.322359","article-title":"Search algorithms under different kinds of heuristics: a comparative study","volume":"30","author":"Bagchi","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00094-1_BIB2","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/mnsc.26.6.633","article-title":"A node elimination procedure for Townsend's algorithm for solving the single machine quadratic penalty function scheduling problem","volume":"26","author":"Bagga","year":"1980","journal-title":"Manage. Sci."},{"key":"10.1016\/0004-3702(95)00094-1_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/1520-6750(199002)37:1<61::AID-NAV3220370104>3.0.CO;2-S","article-title":"Solving resource-constrained project scheduling problems by A\u2217 search","volume":"37","author":"Bell","year":"1990","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/0004-3702(95)00094-1_BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-V","article-title":"Scheduling tasks with sequence dependent processing times","volume":"35","author":"Bianco","year":"1988","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/0004-3702(95)00094-1_BIB5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(89)90010-6","article-title":"Heuristic search in restricted memory","volume":"41","author":"Chakrabarti","year":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00094-1_BIB6","author":"French","year":"1982"},{"key":"10.1016\/0004-3702(95)00094-1_BIB7","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1287\/mnsc.30.5.644","article-title":"On the single machine scheduling problem with quadratic penalty function of completion times: an improved branching procedure","volume":"30","author":"Gupta","year":"1984","journal-title":"Manage. Sci."},{"issue":"2","key":"10.1016\/0004-3702(95)00094-1_BIB8","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum-cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"10.1016\/0004-3702(95)00094-1_BIB9","series-title":"Proceedings AAAI-94","first-page":"1359","article-title":"Memory-bounded bidirectional search","author":"Kaindl","year":"1994"},{"key":"10.1016\/0004-3702(95)00094-1_BIB10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative deepening: an optimal admissible search","volume":"27","author":"Korf","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00094-1_BIB11","series-title":"Proceedings AAAI-92","article-title":"Linear-space best-first search: summary of results","author":"Korf","year":"1992"},{"key":"10.1016\/0004-3702(95)00094-1_BIB12","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the travelling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/0004-3702(95)00094-1_BIB13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/1520-6750(199106)38:3<333::AID-NAV3220380305>3.0.CO;2-0","article-title":"Minimizing flow time on a single machine with job classes and setup times","volume":"38","author":"Mason","year":"1991","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/0004-3702(95)00094-1_BIB14","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(95)00094-1_BIB15","series-title":"Proceedings ECAI-92","first-page":"11","article-title":"Single machine scheduling as a graph search problem with path-dependent arc costs","author":"Ramaswamy","year":"1992"},{"key":"10.1016\/0004-3702(95)00094-1_BIB16","series-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993"},{"key":"10.1016\/0004-3702(95)00094-1_BIB17","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/34.297950","article-title":"Enhanced iterative-deepening search","volume":"16","author":"Reinefeld","year":"1994","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0004-3702(95)00094-1_BIB18","series-title":"Proceedings ECAI-92","first-page":"1","article-title":"Efficient memory-bounded search methods","author":"Russell","year":"1992"},{"key":"10.1016\/0004-3702(95)00094-1_BIB19","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"p-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00094-1_BIB20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.9.1.73","article-title":"Scheduling tasks with deadlines and non-linear loss functions","volume":"9","author":"Schild","year":"1963","journal-title":"Manage. Sci."},{"key":"10.1016\/0004-3702(95)00094-1_BIB21","series-title":"Proceedings IJCAI-89","first-page":"297","article-title":"Fast recursive formulations for best-first search that allow controlled use of memory","author":"Sen","year":"1989"},{"key":"10.1016\/0004-3702(95)00094-1_BIB22","series-title":"Proceedings IEEE Conference on Artificial Intelligence for Applications","first-page":"190","article-title":"Job sequencing with quadratic penalties: an A\u2217-based graph search approach","author":"Sen","year":"1993"},{"key":"10.1016\/0004-3702(95)00094-1_BIB23","series-title":"Proceedings IJCAI-93","first-page":"1423","article-title":"Non-order-preserving evaluation functions: recursive graph-search methods for job sequencing problems","author":"Sen","year":"1993"},{"key":"10.1016\/0004-3702(95)00094-1_BIB24","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/3468.477872","article-title":"Searching graphs with A\u2217: applications to job sequencing","volume":"26","author":"Sen","year":"1996","journal-title":"IEEE Trans. Syst., Man Cybern. Part A Syst. Humans"},{"key":"10.1016\/0004-3702(95)00094-1_BIB25","series-title":"Proceedings IJCAI-91","first-page":"178","article-title":"Admissible search methods for minimum penalty sequencing of jobs with setup times on one and two machines","author":"Sen","year":"1991"},{"key":"10.1016\/0004-3702(95)00094-1_BIB26","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristic methods for the flow shop sequencing problem","volume":"47","author":"Taillard","year":"1990","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/0004-3702(95)00094-1_BIB27","series-title":"Proceedings AAAI-93","article-title":"Pruning duplicate nodes in depth-first search","author":"Taylor","year":"1993"},{"key":"10.1016\/0004-3702(95)00094-1_BIB28","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1287\/mnsc.24.5.530","article-title":"The single machine problem with quadratic penalty function of completion times: a branch and bound solution","volume":"24","author":"Townsend","year":"1978","journal-title":"Manage. Sci."},{"key":"10.1016\/0004-3702(95)00094-1_BIB29","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/opre.41.4.768","article-title":"Best-first search methods for constrained two-dimensional cutting stock problems","volume":"41","author":"Viswanathan","year":"1993","journal-title":"Oper. Res."},{"key":"10.1016\/0004-3702(95)00094-1_BIB30","series-title":"Proceedings AAAI-93","article-title":"Depth-first vs. best-first search: new results","author":"Zhang","year":"1993"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000941?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000941?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:29:43Z","timestamp":1556396983000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000941"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0004370295000941"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00094-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}