Complexity of Single Machine Scheduling subject to Nonnegative Inventory Constraints
SCIE
SCOPUS
- Title
- Complexity of Single Machine Scheduling subject to Nonnegative Inventory Constraints
- Authors
- Briskorn, D; Choi, BC; Lee, K; Leung, J; Pinedo, M
- Date Issued
- 2010-12-01
- Publisher
- ELSEVIER SCIENCE BV
- Abstract
- This paper focuses on single machine scheduling subject to inventory constraints. Jobs either add items to an inventory or remove items from that inventory. Jobs that have to remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a single machine with the minimization of the total weighted completion time, the maximum lateness, and the number of tardy jobs, respectively, as objective and determine their computational complexity. Since the general versions of our problems turn out to be strongly NP-hard, we consider special cases by assuming that different jobs have certain parameter values in common. We determine the computational complexity for all special cases when the objective is either to minimize total completion time or to minimize maximum lateness and for several special cases when the objective is either to minimize total weighted completion time or to minimize the number of tardy jobs. (C) 2010 Elsevier BM. All rights reserved.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/36384
- DOI
- 10.1016/J.EJOR.2010.05.036
- ISSN
- 0377-2217
- Article Type
- Article
- Citation
- EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol. 207, no. 2, page. 605 - 619, 2010-12-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.