Back to Search
Start Over
Single machine scheduling problem with multiple due windows assignment in a group technology.
- Source :
- Journal of Applied Mathematics & Computing; Jun2015, Vol. 48 Issue 1/2, p477-494, 18p
- Publication Year :
- 2015
-
Abstract
- We consider group scheduling problem on a single machine with multiple due windows assignment. Jobs are divided into groups in advance according to their processing similarities, and all jobs of the same group are required to be processed contiguously on the machine in order to achieve production efficiency and save time/money resource. A sequence-independent setup time precedes the processing of each group. The goal is to determine the optimal sequence for both groups and jobs, together with an optimal combination of the due windows assignment strategy so as to minimize the total of earliness, tardiness and due windows related costs. We give an $$O(n\log n)$$ time algorithm for the problem. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15985865
- Volume :
- 48
- Issue :
- 1/2
- Database :
- Complementary Index
- Journal :
- Journal of Applied Mathematics & Computing
- Publication Type :
- Academic Journal
- Accession number :
- 102439923
- Full Text :
- https://doi.org/10.1007/s12190-014-0814-1