Scheduling with tool changes to minimize total completion time: basic results and SPT performance

dc.citation.epage	790	en_US
dc.citation.issueNumber	3	en_US
dc.citation.spage	784	en_US
dc.citation.volumeNumber	157	en_US
dc.contributor.author	Akturk, M. S.	en_US
dc.contributor.author	Ghosh, J. B.	en_US
dc.contributor.author	Gunes, E. D.	en_US
dc.date.accessioned	2015-07-28T11:57:17Z
dc.date.available	2015-07-28T11:57:17Z
dc.date.issued	2004-09-16	en_US
dc.department	Department of Industrial Engineering	en_US
dc.description.abstract	We consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total completion time. We briefly describe the problem and discuss its properties, complexity and solution. Mainly, however, we focus on the performance of the SPT list-scheduling heuristic. We provide theoretical worst-case bounds on SPT performance and also demonstrate its empirical behavior.	en_US
dc.identifier.doi	10.1016/S0377-2217(03)00232-7	en_US
dc.identifier.eissn	1872-6860
dc.identifier.issn	0377-2217
dc.identifier.uri	http://hdl.handle.net/11693/11268
dc.language.iso	English	en_US
dc.publisher	Elsevier	en_US
dc.relation.isversionof	http://dx.doi.org/10.1016/S0377-2217(03)00232-7	en_US
dc.source.title	European Journal of Operational Research	en_US
dc.subject	Scheduling	en_US
dc.subject	Tool Change	en_US
dc.subject	Spt List-scheduling	en_US
dc.subject	Performance Analysis	en_US
dc.title	Scheduling with tool changes to minimize total completion time: basic results and SPT performance	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1

Name:: Scheduling_with_tool_changes_to_minimize_total_completion_time:_Basic_results_and_SPT_performance.pdf
Size:: 276.75 KB
Format:: Adobe Portable Document Format
Description:: Full printable version