{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T04:02:10Z","timestamp":1747627330987,"version":"3.40.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1023\/a:1021897321637","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T23:56:02Z","timestamp":1048290962000},"page":"35-48","source":"Crossref","is-referenced-by-count":8,"title":["A Probe-Based Algorithm for Piecewise Linear Optimization in Scheduling"],"prefix":"10.1007","volume":"118","author":[{"given":"Farid","family":"Ajili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hani","family":"El Sakkout","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"5110897_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"A. Aggoun and N. Beldiceanu, Extending CHIP in order to solve complex scheduling and placement problems, Journal of Mathematical Computer Modelling 17(7) (1993) 57\u201373.","journal-title":"Journal of Mathematical Computer Modelling"},{"key":"5110897_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"M. Bartusch, R.H. M\u00f6hring and F.J. Radermacher, Scheduling project networks with resource constraints and time windows, Annals of Operations Research 16 (1988) 201\u2013240.","journal-title":"Annals of Operations Research"},{"key":"5110897_CR3","volume-title":"Proc. of the Fifth International Conference on Operations Research","author":"E.M.L. Beale","year":"1970","unstructured":"E.M.L. Beale and J.A. Tomlin, Special facilities in a general mathematical system for non-convex problems using ordered sets of variables, in: Proc. of the Fifth International Conference on Operations Research (Tavistock Publications, London, 1970) pp. 447\u2013445."},{"issue":"1","key":"5110897_CR4","first-page":"49","volume":"29","author":"D. Bertsimas","year":"1999","unstructured":"D. Bertsimas, Ch. Darnell and R. Soucy, Portfolio construction through mixed-integer programming at Grantham, Mayo, van Otterloo and Co, Interfaces 29(1) (1999) 49\u201366.","journal-title":"Portfolio construction through mixed-integer programming at Grantham, Mayo, van Otterloo and Co, Interfaces"},{"key":"5110897_CR5","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0004-3702(87)90092-0","volume":"32","author":"D. Chapman","year":"1987","unstructured":"D. Chapman, Planning for conjunctive goals, Artificial Intelligence 32 (1987) 333\u2013377.","journal-title":"Artificial Intelligence"},{"key":"5110897_CR6","unstructured":"CPLEX, CPLEX Manual (1999), URL: http:\/\/www.cplex.com."},{"key":"5110897_CR7","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig, Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"5110897_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artificial Intelligence 49 (1991) 61\u201395.","journal-title":"Artificial Intelligence"},{"key":"5110897_CR9","doi-asserted-by":"crossref","unstructured":"H. El Sakkout and M. Wallace, Probe backtrack search for minimal perturbation in dynamic scheduling, Constraints 5(4), Special Issue on Industrial Constraint-Directed Scheduling (2000).","DOI":"10.1023\/A:1009856210543"},{"key":"5110897_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01585703","volume":"53","author":"R. Fourer","year":"1992","unstructured":"R. Fourer, A Simplex algorithm for piecewise-linear programming III: Computational analysis and applications, Mathematical Programming 53 (1992) 213\u2013235.","journal-title":"Mathematical Programming"},{"key":"5110897_CR11","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/ijoc.7.2.166","volume":"7","author":"R. Fourer","year":"1995","unstructured":"R. Fourer and D.M. Gay, Expressing special structures in an algebraic modeling language for mathematical programming, ORSA Journal on Computing 7 (1995) 166\u2013190.","journal-title":"ORSA Journal on Computing"},{"key":"5110897_CR12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/trsc.14.4.295","volume":"14","author":"J.K. Ho","year":"1980","unstructured":"J.K. Ho, A successive linear optimization approach to the dynamic traffic assignment problem, Transportation Science 14 (1980) 295\u2013305.","journal-title":"Transportation Science"},{"key":"5110897_CR13","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0121047","volume":"24","author":"J.K. Ho","year":"1985","unstructured":"J.K. Ho, Relationships among linear formulations of separable convex piecewise-linear programs, Mathematical Programming Study 24 (1985) 126\u2013140.","journal-title":"Mathematical Programming Study"},{"key":"5110897_CR14","volume-title":"Goal Programming and Extensions","author":"J.P. Ignizio","year":"1976","unstructured":"J.P. Ignizio, Goal Programming and Extensions (Lexington Books, Lexington, MA, 1976)."},{"key":"5110897_CR15","unstructured":"G.L. Nemhauser, E.L. Johnson and I.R. de Farias, A generalized assignment problem with special ordered sets: A polyhedral approach, to appear in the Journal of Mathematical Programming."},{"issue":"4","key":"5110897_CR16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1014440424150","volume":"34","author":"G. Ottosson","year":"2002","unstructured":"G. Ottosson, E.S. Thorsteinsson and J.N. Hooker, Mixed global constraints and inference in CLP-IP solvers, Annals of Mathematics and Artificial Intelligence 34(4) (2002) 271\u2013290.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"5110897_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-540-48085-3_27","volume-title":"Proc. of the 5th International Conference of Principles and Practice of Constraint Programming (CP '99)","author":"P. Refalo","year":"1999","unstructured":"P. Refalo, Tight cooperation and its application in piecewise-linear optimization, in: Proc. of the 5th International Conference of Principles and Practice of Constraint Programming (CP'99), Alexandria, VA, October 1999, Lecture Notes in Computer Science, Vol. 1713 (Springer, New York, 1999) pp. 375\u2013389"},{"key":"5110897_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-2229-4","volume-title":"Goal Programming: Methodology and Applications","author":"M.J. Schniederjans","year":"1995","unstructured":"M.J. Schniederjans, Goal Programming: Methodology and Applications (Kluwer Academic, Boston, MA, 1995)."},{"key":"5110897_CR19","volume-title":"Model Building in Mathematical Programming","author":"H.P. Williams","year":"1994","unstructured":"H.P. Williams, Model Building in Mathematical Programming, 3rd revised edn. (Wiley, New York, 1994).","edition":"3rd revised edn"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021897321637.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021897321637\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021897321637.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:19:39Z","timestamp":1747577979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021897321637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":19,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["5110897"],"URL":"https:\/\/doi.org\/10.1023\/a:1021897321637","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}