×

Modeling the planning and scheduling across the outsourcing supply chain: a chaos-based fast tabu-SA approach. (English) Zbl 1141.90408

Summary: Planning and scheduling are the interrelated manufacturing functions and should be solved simultaneously to achieve the real motives of integration in manufacturing. In this paper, we have addressed the advanced integrated planning and scheduling problem in a rapidly changing environment, where the selection of outsourcing machine/operation, meeting the customers (single or multiple) due date, minimizing the makespan are the main objectives while satisfying several technological constraints. We developed a mixed integer programming model for integrated planning and scheduling across the outsourcing supply chain and showed how such models can be used to make strategic decisions. It is a computationally complex and mathematically intractable problem to solve. In this paper, a chaos-based fast Tabu-simulated annealing (CFTSA) incorporating the features of SA, Tabu and Chaos theory is proposed and applied to solve a large number of problems with increased complexity. In CFTSA algorithm, five types of perturbation schemes are developed and Cauchy probability function is used to escape from local minima and achieve the optimal/near optimal solution in a lesser number of iterations. An intensive comparative study shows the robustness of proposed algorithm. Percentage Heuristic gap is used to show the effectiveness and two ANOVA analyses are carried out to show the consistency and accuracy of the proposed approach.

MSC:

90B30 Production models
90B35 Deterministic scheduling theory in operations research
90B06 Transportation, logistics and supply chain management
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Beckerman M, Adaptive Cooperative System (1997)
[2] DOI: 10.1080/00207549508930142 · Zbl 0914.90156 · doi:10.1080/00207549508930142
[3] Chung, D, Lee, K, Shin, K and Park, J. 2000. An algorithm for job shop scheduling problem with due date constraints consideraing operation subcontract. Proceeding of the 15th ICPR Interational Conference. August2000, Barcelona, Spain.
[4] DOI: 10.1287/inte.20.4.74 · doi:10.1287/inte.20.4.74
[5] DOI: 10.1016/0278-6125(84)90002-5 · doi:10.1016/0278-6125(84)90002-5
[6] Horowitz E, Fundamentals of Data Structures in Pascal (1984)
[7] DOI: 10.1080/07408170304434 · doi:10.1080/07408170304434
[8] DOI: 10.1080/07408179508936762 · doi:10.1080/07408179508936762
[9] DOI: 10.1007/BF01572636 · doi:10.1007/BF01572636
[10] DOI: 10.1080/002075400189653 · Zbl 0945.90513 · doi:10.1080/002075400189653
[11] Kolisch R, Int. J. Prod. Econ. 65 pp 189– (2000)
[12] DOI: 10.1243/095440503322617216 · doi:10.1243/095440503322617216
[13] Simchi-Levi D, Tata (2003)
[14] DOI: 10.1016/S0360-8352(02)00079-7 · doi:10.1016/S0360-8352(02)00079-7
[15] DOI: 10.1080/00207549008942818 · Zbl 0703.90046 · doi:10.1080/00207549008942818
[16] DOI: 10.1007/BF00118077 · doi:10.1007/BF00118077
[17] DOI: 10.1016/j.rcim.2003.09.001 · doi:10.1016/j.rcim.2003.09.001
[18] DOI: 10.1080/002075400418298 · Zbl 1094.90548 · doi:10.1080/002075400418298
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.