{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:19:28Z","timestamp":1759666768762},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf02085647","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T11:22:06Z","timestamp":1124018526000},"page":"339-365","source":"Crossref","is-referenced-by-count":16,"title":["Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem"],"prefix":"10.1007","volume":"50","author":[{"given":"Youngho","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02085647_CR1","volume-title":"Introduction to Sequencing and Scheduling","author":"K.R. Baker","year":"1974","unstructured":"K.R. Baker,Introduction to Sequencing and Scheduling (Wiley, New York, 1974)."},{"key":"BF02085647_CR2","volume-title":"Proc. Symp. on Command and Control Research","author":"D.D. Boyer","year":"1990","unstructured":"D.D. Boyer, E.L. Perry and E.L. Price, Force level control in naval anti-air warfare,Proc. Symp. on Command and Control Research, Naval Postgraduate School, Monterey, CA (June, 1990)."},{"key":"BF02085647_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"P.M. Camerini","year":"1975","unstructured":"P.M. Camerini, L. Fratta and F. Maffioli, On improving relaxation methods by modified gradient techniques, Math. Progr. Study 3(1975)26\u201334.","journal-title":"Math. Progr. Study"},{"key":"BF02085647_CR4","doi-asserted-by":"crossref","first-page":"S40","DOI":"10.1287\/opre.40.1.S40","volume":"40","author":"T.J. Chan","year":"1992","unstructured":"T.J. Chan and C.A. Yano, A multiplier adjustment approach for the set partitioning problem, Oper. Res. 40(1992)S40-S47.","journal-title":"Oper. Res."},{"key":"BF02085647_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Manag. Sci. 27(1981)1\u201318.","journal-title":"Manag. Sci."},{"key":"BF02085647_CR6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"M.R. Garey","year":"1977","unstructured":"M.R. Garey and D.S. Johnson, Two-processor scheduling with start times and deadlines, SIAM J. Comp. 6(1977)416\u2013426.","journal-title":"SIAM J. Comp."},{"key":"BF02085647_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New York, 1979)."},{"key":"BF02085647_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01585725","volume":"46","author":"E.S. Gottlieb","year":"1990","unstructured":"E.S. Gottlieb and M.R. Rao, The generalized assignment problem: valid inequalities and facets, Math. Progr. 46(1990)31\u201352.","journal-title":"Math. Progr."},{"key":"BF02085647_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01585726","volume":"46","author":"E.S. Gottlieb","year":"1990","unstructured":"E.S. Gottlieb and M.R. Rao, (1,k)-configuration facets for the generalized assignment problem, Math. Progr. 46(1990)53\u201360.","journal-title":"Math. Progr."},{"key":"BF02085647_CR10","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","volume":"26","author":"J. Grabowski","year":"1986","unstructured":"J. Grabowski, E. Nowicki and S. Zdrzalka, A block approach for single machine schedule with release dates and due dates, Euro. J. Oper. Res. 26(1986)278\u2013285.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02085647_CR11","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"P.L. Hammer, E.L. Johnson and U.N. Peled, Facets of regular 0\u20131 polytopes, Math. Progr. 8(1975)179\u2013206.","journal-title":"Math. Progr."},{"key":"BF02085647_CR12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"M. Held, P. Wolfe and H.P. Crowder, Validation of subgradient optimization, Math. Progr. 6(1974)62\u201388.","journal-title":"Math. Progr."},{"key":"BF02085647_CR13","unstructured":"Y. Lee, The polyhedral structure of some combinatorial optimization problems with applications to a naval defense problem, Ph.D. Dissertation, Department of Industrial and Systems Engineering, Virginia Polytechnic and State University (August, 1992)."},{"key":"BF02085647_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/1520-6750(199202)39:1<53::AID-NAV3220390105>3.0.CO;2-C","volume":"39","author":"V.J. Leon","year":"1992","unstructured":"V.J. Leon and S.D. Wu, On scheduling with ready-times, due-dates, and vacations, Naval Res. Log. 39(1992)53\u201365.","journal-title":"Naval Res. Log."},{"key":"BF02085647_CR15","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/mnsc.20.5.774","volume":"20","author":"R.E. Marsten","year":"1974","unstructured":"R.E. Marsten, An algorithm for large set partitioning problems, Manag. Sci. 20(1974)774\u2013787.","journal-title":"Manag. Sci."},{"key":"BF02085647_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"BF02085647_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. Padberg","year":"1973","unstructured":"M. Padberg, On the facial structure of set packing polyhedra, Math. Progr. 5(1973)199\u2013215.","journal-title":"Math. Progr."},{"key":"BF02085647_CR18","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"M. Padberg and G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev. 33(1991)60\u2013100.","journal-title":"SIAM Rev."},{"key":"BF02085647_CR19","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","volume":"28","author":"C.N. Potts","year":"1980","unstructured":"C.N. Potts, Analysis of a heuristic for one machine sequencing with release dates and delivery times, Oper. Res. 28(1980)1436\u20131441.","journal-title":"Oper. Res."},{"key":"BF02085647_CR20","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/00207548808947934","volume":"26","author":"S.C. Sarin","year":"1988","unstructured":"S.C. Sarin, S. Ahn and A.B. Bishop, An improved branching scheme for the branch and bound procedure of schedulingn jobs onm parallel machines to minimize total weighted flowtime, Int. J. Prod. Res. 26(1988)1183\u20131191.","journal-title":"Int. J. Prod. Res."},{"key":"BF02085647_CR21","unstructured":"H.D. Sherali, Y. Lee and D.D. Boyer, Models and algorithms for scheduling passive homing device in battle-group anti-air warfare scenarios, Research Report, Department of Industrial and Systems engineering, Virginia Polytechnic Institute and State University, (Dec. 1991), to appear in Naval Res. Log."},{"key":"BF02085647_CR22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","volume":"20","author":"H.D. Sherali","year":"1989","unstructured":"H.D. Sherali and O. Ulular, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Appl. Math. Optim. 20(1989)193\u2013224.","journal-title":"Appl. Math. Optim."},{"key":"BF02085647_CR23","first-page":"75","volume-title":"Proc. NATO Advanced Study and Research Institute on Theoretical Approach to Scheduling Problems","author":"B. Simons","year":"1981","unstructured":"B. Simons, On scheduling with release times and deadlines, in:Proc. NATO Advanced Study and Research Institute on Theoretical Approach to Scheduling Problems, ed. M.A.H. Dempster et al. (Reidel, Hingham, 1981) pp. 75\u201388."},{"key":"BF02085647_CR24","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0212018","volume":"12","author":"B. Simons","year":"1983","unstructured":"B. Simons, Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines, SIAM J. Comp. 12(1983)294\u2013299.","journal-title":"SIAM J. Comp."},{"key":"BF02085647_CR25","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1137\/0218048","volume":"18","author":"B. Simons","year":"1989","unstructured":"B. Simons and M.K. Warmuth, A fast algorithm for multiprocessor scheduling of unit-length jobs, SIAM J. Comp. 18(1989)690\u2013710.","journal-title":"SIAM J. Comp."},{"key":"BF02085647_CR26","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"J.P. Sousa","year":"1992","unstructured":"J.P. Sousa and L.A. Wolsey, A time index formulation on non-preemptive single machine scheduling problem, Math. Progr. 54(1992)353\u2013367.","journal-title":"Math. Progr."},{"key":"BF02085647_CR27","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/moor.14.4.760","volume":"14","author":"E. Zemel","year":"1989","unstructured":"E. Zemel, Easily computable facets of the knapsack polytope, Math. Oper. Res. 14(1989)760\u2013764.","journal-title":"Math. Oper. Res."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085647.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02085647\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:36:24Z","timestamp":1557794184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02085647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF02085647"],"URL":"https:\/\/doi.org\/10.1007\/bf02085647","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}