{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:42:40Z","timestamp":1778827360421,"version":"3.51.4"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0377-2217(00)00286-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:07:57Z","timestamp":1027616877000},"page":"17-26","source":"Crossref","is-referenced-by-count":10,"title":["A time-dependent multiple criteria single-machine scheduling problem"],"prefix":"10.1016","volume":"135","author":[{"given":"Kathrin","family":"Klamroth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Margaret M","family":"Wiecek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00286-1_BIB1","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1057\/palgrave.jors.2600740","article-title":"Scheduling with time dependent processing times: Review and extensions","volume":"50","author":"Alidaee","year":"1999","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB2","series-title":"Multicriteria Analysis","first-page":"279","article-title":"Bicriteria scheduling: Minimizing flowtime and maximum earliness on a single machine","author":"Azizoglu","year":"1997"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/00014788.1979.9728736","article-title":"A multiple objective approach to capital budgeting","volume":"9","author":"Bhaskar","year":"1979","journal-title":"Accounting and Business Research"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0020-0190(97)00195-6","article-title":"The complexity of scheduling starting time dependent tasks with release times","volume":"65","author":"Cheng","year":"1998","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB5","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1016\/S0305-0548(98)00093-8","article-title":"The time dependent machine makespan problem is strongly NP-complete","volume":"26","author":"Cheng","year":"1999","journal-title":"Computers and Opertions Research"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB6","series-title":"Integer Programming","author":"Garfinkel","year":"1972"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/opre.36.1.50","article-title":"A dynamic programming solution to the dynamic, multi-item, single-machine scheduling problem","volume":"36","author":"Gascon","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB8","first-page":"81","article-title":"A brief survey of continuous models of scheduling","volume":"21","author":"Gawiejnowicz","year":"1996","journal-title":"Foundation of Computers and Decision Science"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1018913902852","article-title":"Single machine hierarchical scheduling with customer orders and multiple job classes","volume":"70","author":"Gupta","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/moor.21.1.100","article-title":"Minimizing maximum promptness and maximum lateness on a single machine","volume":"1","author":"Hoogeveen","year":"1996","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0167-6377(95)00023-D","article-title":"Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time","volume":"5","author":"Hoogeveen","year":"1995","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB12","first-page":"343","article-title":"Enumerative approaches to combinatorial optimization, Part II","volume":"11","author":"Ibaraki","year":"1987","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB13","unstructured":"K. Klamroth, M.M. Wiecek, R.L. Hartman, AMADEuS, Affordable MultiAttributeDEcisionS, a decision support tool for multiple criteria capital budgeting, Technical Report, Department of Mathematical Society, Clemson University, Clemson, SC, 1999"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/opre.46.1.17","article-title":"The dynamic and stochastic knapsack problem","volume":"46","author":"Kleywegt","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB15","series-title":"Multiple Criteria Decision Making","first-page":"654","article-title":"Scheduling of unit processing time jobs on a single machine","author":"Kondakci","year":"1997"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB16","doi-asserted-by":"crossref","unstructured":"A. Konov, Scheduling problems with linear increasing processing times, in: U. Zimmermann, U. Derigs, W. Gaul, R.H. Moehring., K.-P. Schuster (Eds.), Operations Research Proceedings 1996, Springer, Berlin, 1997, pp. 208\u2013212","DOI":"10.1007\/978-3-642-60744-8_38"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0898-1221(99)00065-6","article-title":"Relocation problems arising in conservation biology","volume":"37","author":"Kostreva","year":"1999","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1006\/jmaa.1993.1067","article-title":"Time dependency in multiple objective dynamic programming","volume":"173","author":"Kostreva","year":"1993","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00246001","article-title":"Capital budgeting with multiple criteria and multiple decision makers","volume":"7","author":"Kwak","year":"1996","journal-title":"Review of Quantitative Finance and Accounting"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB20","unstructured":"S. Martello, D. Pisinger, P. Toth, New trends in exact algorithms for the 0-1 knapsack problem, in: J. Barcel\u00f3 (Ed.), Proceedings of EURO\/INFORMS-97, Barcelona, 1997, pp. 151\u2013160"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB21","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB22","unstructured":"MATLAB \u2013 The Language of Technical Computing, third ed., The Math Works, Inc., 1999"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB23","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1287\/opre.47.5.744","article-title":"Fast algorithms for parametric scheduling come from extensions to parametric maximum flow","volume":"47","author":"McCormick","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB24","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01586059","article-title":"A time-indexed formulation of nonpreemptive single machine scheduling problems","volume":"54","author":"Sousa","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB25","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0191-2615(95)00032-1","article-title":"A multiobjective programming approach for selecting non-independent transportation investment alternatives","volume":"30","author":"Teng","year":"1996","journal-title":"Transportation Research B"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB26","unstructured":"J.M. van den Akker, LP-based solution methods for single machine scheduling problems, Ph.D. Dissertation, Technische Universiteit Eindhoven, Eindhoven, 1994"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB27","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s101070050071","article-title":"A polyhedral approach to single-machine scheduling problems","volume":"85","author":"van den Akker","year":"1999","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB28","first-page":"649","article-title":"Time preferences in capital budgeting \u2013 an application of interactive multiobjective optimization","volume":"50","author":"Vetschera","year":"1985","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S0377-2217(00)00286-1_BIB29","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/BF01584241","article-title":"Multicriteria integer programming: A (hybrid) dynamic programming recursive approach","volume":"21","author":"Villarreal","year":"1981","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700002861?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700002861?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T14:28:41Z","timestamp":1579271321000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700002861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0377221700002861"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00286-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}