{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T16:15:23Z","timestamp":1770135323135,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf02592090","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:33:10Z","timestamp":1175182390000},"page":"207-227","source":"Crossref","is-referenced-by-count":13,"title":["Scheduling jobs of equal length: complexity, facets and computational results"],"prefix":"10.1007","volume":"72","author":[{"given":"Yves","family":"Crama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592090_CR1","first-page":"457","volume-title":"Economic Decision-Making: Games, Econometrics and Optimisation","author":"R. Aboudi","year":"1990","unstructured":"R. Aboudi and G.L. Nemhauser, \u201cAn assignment problem with side constraints: strong cutting planes and separation,\u201d in: J.J. Gabszewicz, J.-F. Richard and L.A. Wolsey, eds.,Economic Decision-Making: Games, Econometrics and Optimisation (Elsevier, Amsterdam, 1990) pp. 457\u2013471."},{"key":"BF02592090_CR2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/opre.39.2.244","volume":"39","author":"R. Aboudi","year":"1991","unstructured":"R. Aboudi and G.L. Nemhauser, \u201cSome facets for an assignment problem with side constraints,\u201dOperations Research 39 (1991) 244\u2013250.","journal-title":"Operations Research"},{"key":"BF02592090_CR3","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.43.3.444","volume":"43","author":"J. Ahmadi","year":"1995","unstructured":"J. Ahmadi, R. Ahmadi, H. Matsuo and D. Tirupati, \u201cComponent fixture positioning-sequencing for printed circuit board assembly with concurrent operations,\u201dOperations Research 43 (1995) 444\u2013457.","journal-title":"Operations Research"},{"key":"BF02592090_CR4","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/opre.36.2.192","volume":"36","author":"M.O. Ball","year":"1988","unstructured":"M.O. Ball and M.J. Magazine, \u201cSequencing of insertions in printed circuit board assembly,\u201dOperations Research 36 (1988) 192\u2013201.","journal-title":"Operations Research"},{"key":"BF02592090_CR5","first-page":"147","volume":"5","author":"G. Birkhoff","year":"1946","unstructured":"G. Birkhoff, \u201cTres observaciones sobre el algebra lineal,\u201dRevista Universidad Nacional de Tucum\u00e1n, Series A 5 (1946) 147\u2013151.","journal-title":"Revista Universidad Nacional de Tucum\u00e1n, Series A"},{"key":"BF02592090_CR6","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BF03543080","volume":"26","author":"Y. Crama","year":"1990","unstructured":"Y. Crama, A.W.J. Kolen, A.G. Oerlemans and F.C.R. Spieksma, \u201cThroughput rate optimization in the automated assembly of printed circuit boards,\u201dAnnals of Operations Research 26 (1990) 455\u2013480.","journal-title":"Annals of Operations Research"},{"key":"BF02592090_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 (Freeman, New York, 1979)."},{"key":"BF02592090_CR8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M.R. Garey","year":"1981","unstructured":"M.R. Garey, D.S. Johnson, B.B. Simons and R.E. Tarjan, \u201cScheduling unit-time tasks with arbitrary release times and deadlines,\u201dSIAM Journal on Computing 10 (1981) 256\u2013269.","journal-title":"SIAM Journal on Computing"},{"key":"BF02592090_CR9","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":"BF02592090_CR10","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, \u201cA time-indexed formulation of non-preemptive single-machine scheduling problems\u201dMathematical Programming 54 (1992) 353\u2013367.","journal-title":"Mathematical Programming"},{"key":"BF02592090_CR11","series-title":"Report M92-06","volume-title":"The complexity of scheduling short tasks with few starting times","author":"F.C.R. Spieksma","year":"1992","unstructured":"F.C.R. Spieksma and Y. Crama, \u201cThe complexity of scheduling short tasks with few starting times,\u201d Report M92-06, University of Limburg, The Netherlands (1992)."},{"key":"BF02592090_CR12","volume-title":"LP-based solution methods for single-machine scheduling problems","author":"J.M. Akker van den","year":"1994","unstructured":"J.M. van den Akker, \u201cLP-based solution methods for single-machine scheduling problems\u201d, Ph.D. Thesis, Eindhoven University of Technology, The Netherlands (1994)."},{"key":"BF02592090_CR13","series-title":"Memorandum COSOR 93-27","volume-title":"Facet inducing inequalities for single-machine scheduling problems","author":"J.M. Akker van den","year":"1993","unstructured":"J.M. van den Akker, C.P.M. van Hoesel and M.W.P. Savelsbergh, \u201cFacet inducing inequalities for single-machine scheduling problems,\u201d Memorandum COSOR 93-27, Eindhoven University of Technology, The Netherlands (1993)."},{"key":"BF02592090_CR14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01328741","volume":"5","author":"P.J.M. Laarhoven van","year":"1993","unstructured":"P.J.M. van Laarhoven and W.H.M. Zijm, \u201cProduction preparation and numerical control in PCB assembly,\u201dInternational Journal of Flexible Manufacturing Systems 5 (1993) 187\u2013207.","journal-title":"International Journal of Flexible Manufacturing Systems"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592090.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592090\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T03:33:00Z","timestamp":1587439980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF02592090"],"URL":"https:\/\/doi.org\/10.1007\/bf02592090","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}