Batch scheduling to minimize maximum lateness

dc.citation.epage	80	en_US
dc.citation.issueNumber	2	en_US
dc.citation.spage	77	en_US
dc.citation.volumeNumber	21	en_US
dc.contributor.author	Ghosh, J. B.	en_US
dc.contributor.author	Gupta, J. N. D.	en_US
dc.date.accessioned	2015-07-28T11:56:46Z
dc.date.available	2015-07-28T11:56:46Z
dc.date.issued	1997	en_US
dc.department	Department of Management	en_US
dc.description.abstract	We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem.	en_US
dc.description.provenance	Made available in DSpace on 2015-07-28T11:56:46Z (GMT). No. of bitstreams: 1 10.1016-S0167-6377(97)00028-X.pdf: 323625 bytes, checksum: a0a85269bac9580748363aeaacbd3133 (MD5)	en
dc.identifier.doi	10.1016/S0167-6377(97)00028-X	en_US
dc.identifier.issn	0167-6377
dc.identifier.uri	http://hdl.handle.net/11693/11068
dc.language.iso	English	en_US
dc.publisher	Elsevier	en_US
dc.relation.isversionof	http://dx.doi.org/10.1016/S0167-6377(97)00028-X	en_US
dc.source.title	Operations Research Letters	en_US
dc.subject	Analysis of algorithms	en_US
dc.subject	Dynamic programming	en_US
dc.subject	Production	en_US
dc.subject	Scheduling	en_US
dc.title	Batch scheduling to minimize maximum lateness	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1