We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Nested partitions for the large-scale extended job shop scheduling problem.
- Authors
Hoksung Yau; Leyuan Shi
- Abstract
This paper addresses the large-scale extended job shop scheduling problem while considering the bill of material and the working shifts constraints. We propose two approaches for the problem. One is based on dispatching rules (DR), and the other is an application of the Nested Partitions (NP) Framework. A sampling approach for the exact feasible subregion is developed to complete the NP method. Furthermore, to efficiently search each subregion, a weighted sampling approach is also presented. Computational experiments show that the NP method with weighted sampling can find good solutions for most large-scale extended job shop scheduling problems.
- Subjects
PARTITIONS (Mathematics); NUMBER theory; HALL polynomials; JOB shops; WORKSHOPS (Facilities); PRODUCTION scheduling
- Publication
Annals of Operations Research, 2009, Vol 168, Issue 1, p23
- ISSN
0254-5330
- Publication type
Article
- DOI
10.1007/s10479-008-0370-x