{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T18:46:45Z","timestamp":1778698005206,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10589-010-9343-5","type":"journal-article","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T16:49:14Z","timestamp":1280767754000},"page":"399-421","source":"Crossref","is-referenced-by-count":25,"title":["Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan"],"prefix":"10.1007","volume":"48","author":[{"given":"Grzegorz","family":"Walig\u00f3ra","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,3]]},"reference":[{"issue":"1\u20134","key":"9343_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/B:ANOR.0000030682.25673.c0","volume":"129","author":"J. B\u0142a\u017cewicz","year":"2004","unstructured":"B\u0142a\u017cewicz, J., Kovalyov, M.Y., Machowiak, M., Trystram, D., W\u0119glarz, J.: Malleable task scheduling to minimize the makespan. Ann. Oper. Res. 129(1\u20134), 65\u201380 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9343_CR2","unstructured":"Burkov, V.N.: Raspriedielenije riesursow kak zadacza optimalnogo bystrodiejstwia. Avtom. Telem. 27(7) (1966)"},{"key":"9343_CR3","volume-title":"Project Scheduling\u2014A Research Handbook","author":"E.L. Demeulemeester","year":"2002","unstructured":"Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling\u2014A Research Handbook. Kluwer, Boston (2002)"},{"key":"9343_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications","author":"C.A. Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, Oxford (1995)"},{"key":"9343_CR5","first-page":"1","volume-title":"Project Scheduling\u2014Recent Models, Algorithms and Applications","author":"W.S. Herroelen","year":"1999","unstructured":"Herroelen, W.S., Demeulemeester, E.L., De Reyck, B.: A classification scheme for project scheduling. In: W\u0119glarz, J. (ed.) Project Scheduling\u2014Recent Models, Algorithms and Applications, pp. 1\u201326. Kluwer, Dordrecht (1999)"},{"key":"9343_CR6","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/978-3-642-76401-1_26","volume-title":"Modern Production Concepts","author":"A. Janiak","year":"1991","unstructured":"Janiak, A.: Scheduling and resource allocation problems in some flow type manufacturing processes. In: Fandel, G., Zapfel, G. (eds.) Modern Production Concepts, pp. 404\u2013415. Springer, Berlin (1991)"},{"issue":"3","key":"9343_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0377-2217(91)90065-4","volume":"53","author":"A. Janiak","year":"1991","unstructured":"Janiak, A.: Single machine scheduling problem with a common deadline and resource dependent release dates. Eur. J. Oper. Res. 53(3), 317\u2013325 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9343_CR8","first-page":"315","volume":"29","author":"J. J\u00f3zefowska","year":"2004","unstructured":"J\u00f3zefowska, J., Walig\u00f3ra, G.: Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems. Found. Comput. Decis. Sci. 29(4), 315\u2013328 (2004)","journal-title":"Found. Comput. Decis. Sci."},{"issue":"2","key":"9343_CR9","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0377-2217(97)00346-9","volume":"107","author":"J. J\u00f3zefowska","year":"1998","unstructured":"J\u00f3zefowska, J., W\u0119glarz, J.: On a methodology for discrete-continuous scheduling. Eur. J. Oper. Res. 107(2), 338\u2013353 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9343_CR10","first-page":"289","volume-title":"Project Scheduling\u2014Recent Models, Algorithms and Applications","author":"J. J\u00f3zefowska","year":"1999","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., W\u0119glarz, J.: Project scheduling under discrete and continuous resources. In: W\u0119glarz, J. (ed.) Project Scheduling\u2014Recent Models, Algorithms and Applications, pp. 289\u2013308. Kluwer, Dordrecht (1999)"},{"issue":"3","key":"9343_CR11","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s001860000094","volume":"52","author":"J. J\u00f3zefowska","year":"2000","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., W\u0119glarz, J.: Solving the discrete-continuous project scheduling problem via its discretization. Math. Methods Oper. Res. 52(3), 489\u2013499 (2000)","journal-title":"Math. Methods Oper. Res."},{"issue":"1\u20134","key":"9343_CR12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1010954031930","volume":"102","author":"J. J\u00f3zefowska","year":"2001","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., W\u0119glarz, J.: Simulated annealing for multi-mode resource-constrained project scheduling problem. Ann. Oper. Res. 102(1\u20134), 137\u2013155 (2001)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"9343_CR13","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jos.119","volume":"5","author":"J. J\u00f3zefowska","year":"2002","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., W\u0119glarz, J.: A heuristic approach to allocating the continuous resource in discrete-continuous scheduling problems to minimize the makespan. J.\u00a0Sched. 5(6), 487\u2013499 (2002)","journal-title":"J.\u00a0Sched."},{"key":"9343_CR14","first-page":"347","volume-title":"Industrial Scheduling","author":"J.E. Kelley","year":"1963","unstructured":"Kelley, J.E.: The critical path method: resource planning and scheduling. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 347\u2013365. Prentice-Hall, Englewood Cliffs (1963)"},{"key":"9343_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-50296-5","volume-title":"Project Scheduling under Resource Constraints\u2014Efficient Heuristics for Several Problem Classes","author":"R. Kolisch","year":"1995","unstructured":"Kolisch, R.: Project Scheduling under Resource Constraints\u2014Efficient Heuristics for Several Problem Classes. Physica, Heidelberg (1995)"},{"key":"9343_CR16","unstructured":"Lawrence, C., Zhou, J.L., Tits, A.L.: Users guide for CFSQP Version 2.5. Available by email: andre@eng.umd.edu (1997)"},{"issue":"7","key":"9343_CR17","doi-asserted-by":"crossref","first-page":"2141","DOI":"10.1016\/j.cor.2006.09.022","volume":"35","author":"G. Walig\u00f3ra","year":"2008","unstructured":"Walig\u00f3ra, G.: Discrete-continuous project scheduling with discounted cash flows\u2014a tabu search approach. Comput. Oper. Res. 35(7), 2141\u20132153 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9343_CR18","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.ejor.2007.11.009","volume":"193","author":"G. Walig\u00f3ra","year":"2009","unstructured":"Walig\u00f3ra, G.: Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation. Eur. J. Oper. Res. 193(3), 849\u2013856 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"9343_CR19","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1109\/TSMC.1976.4309456","volume":"6","author":"J. W\u0119glarz","year":"1976","unstructured":"W\u0119glarz, J.: Time-optimal control of resource allocation in a complex of operations framework. IEEE Trans. Syst. Man Cybern. 6(11), 783\u2013788 (1976)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"9343_CR20","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1109\/TC.1980.1675652","volume":"C-29","author":"J. W\u0119glarz","year":"1980","unstructured":"W\u0119glarz, J.: Multiprocessor scheduling with memory allocation\u2014a deterministic approach. IEEE Trans. Comput. C-29, 703\u2013709 (1980)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"9343_CR21","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1287\/mnsc.27.9.1040","volume":"27","author":"J. W\u0119glarz","year":"1981","unstructured":"W\u0119glarz, J.: Project scheduling with continuously-divisible, doubly constrained resources. Manag. Sci. 27(9), 1040\u20131052 (1981)","journal-title":"Manag. Sci."},{"key":"9343_CR22","first-page":"105","volume-title":"Optimization and Control of Dynamic Operational Research Models","author":"J. W\u0119glarz","year":"1982","unstructured":"W\u0119glarz, J.: Modelling and control of dynamic resource allocation project scheduling systems. In: Tzafestas, S.G. (ed.) Optimization and Control of Dynamic Operational Research Models, pp. 105\u2013140. North-Holland, Amsterdam (1982)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10589-010-9343-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T18:40:30Z","timestamp":1635878430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-010-9343-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,3]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9343"],"URL":"https:\/\/doi.org\/10.1007\/s10589-010-9343-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,3]]}}}