Referenced Items are not available for this document.
The problem of scheduling n jobs on a single machine is investigated, where the concept of deteriorating and the learning effect are considered simultaneously. In this model, the optimal schedule of the problem may be different from that of the classical version of the problem. We prove some properties of the problems for the following optimization criteria: makespan and total completion time. Based on these properties, we introduce polynomial solutions for some special problems
Published in:
Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on
(Volume:2
)
Date of Conference: 0-0 0
- Page(s):
- 7254 - 7257
- Print ISBN:
- 1-4244-0332-4
- INSPEC Accession Number:
- 9076446
- Conference Location :
- Dalian
- Digital Object Identifier :
- 10.1109/WCICA.2006.1714494
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
