Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted

doi:10.1002/nav.10039

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chen, JY	en_US
dc.contributor.author	Lin, SF	en_US
dc.date.accessioned	2014-12-08T15:41:43Z	-
dc.date.available	2014-12-08T15:41:43Z	-
dc.date.issued	2002-12-01	en_US
dc.identifier.issn	0894-069X	en_US
dc.identifier.uri	http://dx.doi.org/10.1002/nav.10039	en_US
dc.identifier.uri	http://hdl.handle.net/11536/28366	-
dc.description.abstract	In this paper, a single-machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch-and-bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. (C) 2002 Wiley Periodicals, Inc.	en_US
dc.language.iso	en_US	en_US
dc.subject	scheduling theory	en_US
dc.subject	branch-and-bound	en_US
dc.subject	earliness/tardiness	en_US
dc.subject	idle time	en_US
dc.subject	dominance rule	en_US
dc.title	Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1002/nav.10039	en_US
dc.identifier.journal	NAVAL RESEARCH LOGISTICS	en_US
dc.citation.volume	49	en_US
dc.citation.issue	8	en_US
dc.citation.spage	760	en_US
dc.citation.epage	780	en_US
dc.contributor.department	電控工程研究所	zh_TW
dc.contributor.department	Institute of Electrical and Control Engineering	en_US
dc.identifier.wosnumber	WOS:000179521800003	-
dc.citation.woscount	2	-
Appears in Collections:	Articles

Files in This Item:

000179521800003.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.