@article{kravchenko_minimizing_2009,
	series = {European {Journal} of {Operational} {Research}},
	title = {Minimizing the number of machines for scheduling jobs with equal processing times},
	volume = {199},
	url = {http://ideas.repec.org/a/eee/ejores/v199y2009i2p595-600.html},
	abstract = {In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a feasible schedule in such a way that the maximal number of simultaneously used machines is minimal. We give a polynomial algorithm for this problem.},
	number = {2},
	urldate = {2010-04-23TZ},
	journal = {European Journal of Operational Research},
	author = {Kravchenko, Svetlana A. and Werner, Frank},
	year = {2009},
	keywords = {Parallel machine scheduling Linear programming},
	pages = {595--600}
}

{"_id":"LD8z7amJxG2xBPtm3","bibbaseid":"kravchenko-werner-minimizingthenumberofmachinesforschedulingjobswithequalprocessingtimes-2009","downloads":0,"creationDate":"2016-12-19T20:50:58.755Z","title":"Minimizing the number of machines for scheduling jobs with equal processing times","author_short":["Kravchenko, S. A.","Werner, F."],"year":2009,"bibtype":"article","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"article","type":"article","series":"European Journal of Operational Research","title":"Minimizing the number of machines for scheduling jobs with equal processing times","volume":"199","url":"http://ideas.repec.org/a/eee/ejores/v199y2009i2p595-600.html","abstract":"In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a feasible schedule in such a way that the maximal number of simultaneously used machines is minimal. We give a polynomial algorithm for this problem.","number":"2","urldate":"2010-04-23TZ","journal":"European Journal of Operational Research","author":[{"propositions":[],"lastnames":["Kravchenko"],"firstnames":["Svetlana","A."],"suffixes":[]},{"propositions":[],"lastnames":["Werner"],"firstnames":["Frank"],"suffixes":[]}],"year":"2009","keywords":"Parallel machine scheduling Linear programming","pages":"595--600","bibtex":"@article{kravchenko_minimizing_2009,\n\tseries = {European {Journal} of {Operational} {Research}},\n\ttitle = {Minimizing the number of machines for scheduling jobs with equal processing times},\n\tvolume = {199},\n\turl = {http://ideas.repec.org/a/eee/ejores/v199y2009i2p595-600.html},\n\tabstract = {In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a feasible schedule in such a way that the maximal number of simultaneously used machines is minimal. We give a polynomial algorithm for this problem.},\n\tnumber = {2},\n\turldate = {2010-04-23TZ},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Kravchenko, Svetlana A. and Werner, Frank},\n\tyear = {2009},\n\tkeywords = {Parallel machine scheduling Linear programming},\n\tpages = {595--600}\n}\n\n","author_short":["Kravchenko, S. A.","Werner, F."],"key":"kravchenko_minimizing_2009","id":"kravchenko_minimizing_2009","bibbaseid":"kravchenko-werner-minimizingthenumberofmachinesforschedulingjobswithequalprocessingtimes-2009","role":"author","urls":{"Paper":"http://ideas.repec.org/a/eee/ejores/v199y2009i2p595-600.html"},"keyword":["Parallel machine scheduling Linear programming"],"downloads":0,"html":""},"search_terms":["minimizing","number","machines","scheduling","jobs","equal","processing","times","kravchenko","werner"],"keywords":["parallel machine scheduling linear programming"],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}