A modified tabu search algorithm for cost-based job shop problem
| Autor: | Kien Ming Ng, H. L. Ong, Z. C. Zhu |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Marketing
Inventory control Schedule 021103 operations research Operations research Job shop Computer science Strategy and Management Reliability (computer networking) 0211 other engineering and technologies Holding cost 02 engineering and technology Management Science and Operations Research Tabu search Management Information Systems Scheduling (computing) Search algorithm 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing |
| Zdroj: | Journal of the Operational Research Society. 61:611-619 |
| ISSN: | 1476-9360 0160-5682 |
| DOI: | 10.1057/jors.2009.9 |
| Popis: | In this paper, a cost-based job shop problem (JIT-JSP) is proposed to model the multi-order processing procedure in a just-in-time (JIT) environment. The objective of JIT-JSP is to minimize three costs: work-in-process holding cost of half-finished orders, inventory holding cost of finished orders and backorder cost of unfulfilled orders. A modified tabu search (MTS) method is developed to improve the schedule quality by searching the neighbourhood of a feasible schedule iteratively. The MTS method is comprised of three components that help to ensure a more effective searching procedure: neighbourhood structure, memory structure and filter structure. Computational results show that the MTS method significantly improves the initial schedule generated by an arbitrarily selected dispatching rule. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink