Multi-agent-based workload control for make-to-order manufacturing. (English) Zbl 1151.90439
Summary: Workload control is a production planning and control concept designed to meet the need of the make-to-order industry. In this paper, a multi-agent workload control methodology that simultaneously addresses due date setting, job release and scheduling is proposed. To be consistent with just-in-time production, the objective of minimizing weighted job earliness and tardiness is used. Two new rules are developed, by introducing a feedback mechanism, to set job due dates dynamically. These two new rules implicitly include job pool times and, thus, eliminate the need to estimate job pool times in the presence of workload control. At the critical norm defined in this paper job release control can reduce average job flowtime and work-in-process inventory, without worsening earliness and tardiness, and lead-time performances. The proposed methodology is implemented in a flexible job shop environment. The computational results indicate that the proposed methodology is very effective for production planning and control in make-to-order companies. In addition, the proposed methodology is extremely fast and can be implemented in real time.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
References:
| [1] | DOI: 10.1287/mnsc.30.9.1093 · doi:10.1287/mnsc.30.9.1093 |
| [2] | DOI: 10.1080/00207540210147043 · Zbl 1064.90541 · doi:10.1080/00207540210147043 |
| [3] | DOI: 10.1080/002075497195821 · Zbl 0940.90540 · doi:10.1080/002075497195821 |
| [4] | DOI: 10.1016/0272-6963(83)90009-8 · doi:10.1016/0272-6963(83)90009-8 |
| [5] | Bertrand JWM, Int. J. Prod. Res. 30 pp 3– (1993) |
| [6] | DOI: 10.1016/0377-2217(89)90100-8 · Zbl 0658.90049 · doi:10.1016/0377-2217(89)90100-8 |
| [7] | DOI: 10.1016/S0360-8352(97)00317-3 · doi:10.1016/S0360-8352(97)00317-3 |
| [8] | Conway RW, J. Ind. Eng. 16 pp 228– (1965) |
| [9] | DOI: 10.1080/00207549508930210 · Zbl 0916.90123 · doi:10.1080/00207549508930210 |
| [10] | DOI: 10.1016/S0377-2217(97)00013-1 · Zbl 0951.90023 · doi:10.1016/S0377-2217(97)00013-1 |
| [11] | DOI: 10.1016/S0272-6963(97)00011-9 · doi:10.1016/S0272-6963(97)00011-9 |
| [12] | Hodgson TJ, IIE Trans. 32 pp 177– (2000) |
| [13] | DOI: 10.1080/00207540310001624375 · Zbl 1094.90528 · doi:10.1080/00207540310001624375 |
| [14] | DOI: 10.1109/TSMCC.2002.1009117 · doi:10.1109/TSMCC.2002.1009117 |
| [15] | DOI: 10.1080/00207548908942587 · doi:10.1080/00207548908942587 |
| [16] | Keskinocak P, Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era pp 485– (2004) |
| [17] | DOI: 10.1016/S0925-5273(00)00037-2 · doi:10.1016/S0925-5273(00)00037-2 |
| [18] | DOI: 10.1016/0925-5273(95)00199-9 · doi:10.1016/0925-5273(95)00199-9 |
| [19] | DOI: 10.1016/0925-5273(94)90013-2 · doi:10.1016/0925-5273(94)90013-2 |
| [20] | DOI: 10.1287/opre.9.3.383 · Zbl 0108.14803 · doi:10.1287/opre.9.3.383 |
| [21] | DOI: 10.1002/(SICI)1099-1425(200001/02)3:1<3::AID-JOS32>3.0.CO;2-Y · Zbl 1028.90018 · doi:10.1002/(SICI)1099-1425(200001/02)3:1<3::AID-JOS32>3.0.CO;2-Y |
| [22] | DOI: 10.1016/S0377-2217(99)00345-8 · Zbl 0983.90021 · doi:10.1016/S0377-2217(99)00345-8 |
| [23] | DOI: 10.1080/00207548908942609 · doi:10.1080/00207548908942609 |
| [24] | DOI: 10.1080/00207549408956987 · Zbl 0902.90100 · doi:10.1080/00207549408956987 |
| [25] | Moses SA, IIE Trans. 31 pp 989– (1999) |
| [26] | DOI: 10.1108/01443570310471820 · doi:10.1108/01443570310471820 |
| [27] | DOI: 10.1016/S0925-5273(98)00050-4 · doi:10.1016/S0925-5273(98)00050-4 |
| [28] | DOI: 10.1111/j.1540-5915.1994.tb01871.x · doi:10.1111/j.1540-5915.1994.tb01871.x |
| [29] | Pinedo M, Scheduling Theory, Algorithms and Systems (2002) |
| [30] | DOI: 10.1016/0272-6963(84)90005-6 · doi:10.1016/0272-6963(84)90005-6 |
| [31] | DOI: 10.1111/j.1540-5915.1988.tb00260.x · doi:10.1111/j.1540-5915.1988.tb00260.x |
| [32] | Saad A, Intell. Automat. Soft Comput. 3 pp 229– (1997) |
| [33] | DOI: 10.1016/S0925-5273(98)00248-5 · doi:10.1016/S0925-5273(98)00248-5 |
| [34] | DOI: 10.1080/002075400189590 · Zbl 0945.90512 · doi:10.1080/002075400189590 |
| [35] | DOI: 10.1287/mnsc.44.11.S65 · Zbl 0988.90510 · doi:10.1287/mnsc.44.11.S65 |
| [36] | DOI: 10.1016/0925-5273(95)00088-7 · doi:10.1016/0925-5273(95)00088-7 |
| [37] | DOI: 10.1109/5326.704596 · doi:10.1109/5326.704596 |
| [38] | DOI: 10.1109/5326.798770 · doi:10.1109/5326.798770 |
| [39] | DOI: 10.1287/mnsc.38.7.1018 · Zbl 0825.90512 · doi:10.1287/mnsc.38.7.1018 |
| [40] | DOI: 10.1109/TSMCB.2004.842412 · doi:10.1109/TSMCB.2004.842412 |
| [41] | DOI: 10.1080/00207540210162992 · doi:10.1080/00207540210162992 |
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.
