{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:24:23Z","timestamp":1760707463378},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bf01096772","type":"journal-article","created":{"date-parts":[[2005,2,5]],"date-time":"2005-02-05T09:45:48Z","timestamp":1107596748000},"page":"289-309","source":"Crossref","is-referenced-by-count":11,"title":["Single machine scheduling with flow time and earliness penalties"],"prefix":"10.1007","volume":"3","author":[{"given":"Jonathan F.","family":"Bard","sequence":"first","affiliation":[]},{"given":"Krishnamurthi","family":"Venkatraman","sequence":"additional","affiliation":[]},{"given":"Thomas A.","family":"Feo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1080\/05695558108974544","volume":"13","author":"K. R. Baker","year":"1981","unstructured":"Baker, K. R. and Bertrand, J. W. M. (1981), A Comparison of Due Date Selection Rules,AIIE Transactions 13, 123?131.","journal-title":"AIIE Transactions"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0377-2217(80)90087-9","volume":"5","author":"S. P. Bansal","year":"1980","unstructured":"Bansal, S. P. 1980), Single Machine Scheduling to Minimize Weighted Sum of Completion Times with Secondary Criterion ? a Branch and Bound Approach,European Journal of Operational Research 5, 177?181.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/mnsc.35.2.249","volume":"35","author":"J. F. Bard","year":"1989","unstructured":"Bard, J. F. and Feo, T. A. (1989), Operations Sequencing in Discrete Parts Manufacturing,Management Science 35(2), 249?255.","journal-title":"Management Science"},{"issue":"1","key":"CR4","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/opre.29.1.146","volume":"29","author":"J. W. Barnes","year":"1981","unstructured":"Barnes, J. W. and Vanston, L. K. (1981), Scheduling Jobs with Linear Delay Penalties and Sequences Dependent Setup Costs,Operations Research 29(1), 146?160.","journal-title":"Operations Research"},{"key":"CR5","first-page":"101","volume":"20","author":"E. E. Bomberger","year":"1966","unstructured":"Bomberger, E. E. (1966), A Dynamic Programming Approach to a Lot Size Scheduling Problem,Management Science 20, 101?109.","journal-title":"Management Science"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1002\/nav.3800180410","volume":"18","author":"P. Bratley","year":"1971","unstructured":"Bratley, P., Florian, M., and Robillard, P. (1971), Scheduling with Earliest Start and Due Date Constraints,Naval Research Logistics Quarterly 18, 511?517.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0377-2217(88)90356-6","volume":"34","author":"S. Chand","year":"1988","unstructured":"Chand, S. and Schneeberger, H. (1988), Single Machine Scheduling to Minimize Weighted Earliness Subject to No Tardy Jobs,European Journal of Operational Research 34, 221?230.","journal-title":"European Journal of Operational Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/opre.27.1.161","volume":"27","author":"E. V. Denardo","year":"1979","unstructured":"Denardo, E. V. and Fox, B. L. (1979), Shortest Route Methods; 1. Reaching, Pruning and Buckets,Operations Research 27, 161?186.","journal-title":"Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1287\/mnsc.33.6.784","volume":"33","author":"G. Dobson","year":"1987","unstructured":"Dobson, G., Karmarkar, U. S., and Rummel, J. F. (1987), Batching to Minimize Flow Times on One Machine,Management Science 33, 784?799.","journal-title":"Management Science"},{"key":"CR10","volume-title":"The Art and Theory of Dynamic Programming","author":"S. E. Dreyfus","year":"1976","unstructured":"Dreyfus, S. E. and Law, A. (1976),The Art and Theory of Dynamic Programming, Academic Press, New York."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/S0377-2217(82)80010-6","volume":"11","author":"J. Erschler","year":"1982","unstructured":"Erschler, J., Fontan, G., Merce, C., and Roubellat, F. (1982), Applying New Dominance Concepts to Job Schedule Optimization,European Journal of Operational Research 11, 60?66.","journal-title":"European Journal of Operational Research"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.35.3.378","volume":"35","author":"B. Faaland","year":"1987","unstructured":"Faaland, B. and Schmitt, T. (1987), Scheduling Tasks with Due Dates in a Fabrication\/Assembly Process,Operations Research 35, 378?388.","journal-title":"Operations Research"},{"issue":"8","key":"CR13","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/0305-0548(91)90001-8","volume":"18","author":"T. A. Feo","year":"1991","unstructured":"Feo, T. A., Venkatraman, K. and Bard, J. F. (1991), A GRASP for a Difficult Single Machine Scheduling Problem,Computers & Operations Research 18(8), 635?643.","journal-title":"Computers & Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(87)90033-5","volume":"14","author":"T. D. Fry","year":"1987","unstructured":"Fry, T. D. and Leong, G. K. (1987) A Bi-Criterion Approach to Minimizing Inventory Costs on a Single Machine When Early Shipments Are Forbidden,Computers & Operations Research 14, 363?368.","journal-title":"Computers & Operations Research"},{"key":"CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S. (1979),Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., San Francisco."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0483(87)90071-5","volume":"15","author":"S. K. Gupta","year":"1987","unstructured":"Gupta, S. K. and Kyparisis, J. (1987), Single Machine Scheduling Research,Omega 15, 207?227.","journal-title":"Omega"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0166-218X(83)90019-7","volume":"5","author":"A. M. A. Harriri","year":"1983","unstructured":"Harriri, A. M. A. and Potts, C. N. (1983), An Algorithm for Single Machine Sequencing with Release Dates to Minimize Total Weighted Completion Time,Discrete Applied Math 5, 99?109.","journal-title":"Discrete Applied Math"},{"key":"CR18","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M. and Karp, R. M. (1962), A Dynamic Programming Approach to Sequencing Problems,J. SIAM 10, 196?210.","journal-title":"J. SIAM"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1002\/nav.3800280411","volume":"28","author":"J. J. Kanet","year":"1981","unstructured":"Kanet, J. J. (1981), Minimizing the Average Deviation of Job Completion Times about a Common Due Date,Naval Research Logistical Quarterly 28, 643?651.","journal-title":"Naval Research Logistical Quarterly"},{"issue":"4598","key":"CR20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, Jr., C. D., and Vecchi, M. P. (May 13, 1983), Optimization by Simulated Annealing,Science 220(4598), 671?680.","journal-title":"Science"},{"issue":"4","key":"CR21","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.24.4.611","volume":"24","author":"T. L. Morin","year":"1976","unstructured":"Morin, T. L. and Marsten, R. E. (1976), Branch-and-Bound Strategies for Dynamic Programming,Operations Research 24(4), 611?627.","journal-title":"Operations Research"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/opre.33.3.562","volume":"33","author":"M. E. Posner","year":"1985","unstructured":"Posner, M. E. (1985), Minimizing Weighted Completion Times with Deadlines,Operations Research 33, 562?574.","journal-title":"Operations Research"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"C. C. Potts","year":"1985","unstructured":"Potts, C. C. and Van Wassenhove, L. N. (1985), A Branch and Bound Algorithm for the Total Weighted Tardiness Problem,Operations Research 33, 363?377.","journal-title":"Operations Research"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/mnsc.34.2.254","volume":"34","author":"T. Sen","year":"1988","unstructured":"Sen, T., Raizadeh, F. M. E., and Dileepan, P. (1988), A Branch and Bound Approach the Bicriterion Problem Involving Total Flow Time and Range of Lateness,Management Science 34, 254?260.","journal-title":"Management Science"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096772.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01096772\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01096772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T05:42:29Z","timestamp":1556343749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01096772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF01096772"],"URL":"https:\/\/doi.org\/10.1007\/bf01096772","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}