Nested partitions for the large-scale extended job shop scheduling problem

Hoksung Yau () and Leyuan Shi ()

Annals of Operations Research, 2009, vol. 168, issue 1, 23-39

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. Copyright Springer Science+Business Media, LLC 2009

Keywords: Job shop; Nested partitions; Dispatching rules (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-008-0370-x (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:168:y:2009:i:1:p:23-39:10.1007/s10479-008-0370-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-008-0370-x

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().