Reducing tardy jobs by integrating process planning and scheduling functions. (English) Zbl 1198.90214
Summary: This paper presents a dynamic approach to reduce tardy jobs through the integration of process planning and scheduling in a batch-manufacturing environment. The developed method aims at re-generating a schedule with fewer tardy jobs, step by step, by exploring the process plan solution space of the tardy jobs. The integrated system comprises a process planning module, a scheduling module, and an integrator module. The process planning module employs an optimisation approach in which the entire plan solution space is first generated and a search algorithm is then used to find the optimal plan, while the scheduling module is based on commonly used heuristics. Based on the job tardiness information of the generated schedule, the integrator module automatically issues a modification order to the process plan solution space of the tardy jobs. The process planning and scheduling modules are then re-run to generate a new plan/schedule solution. Through this iterative process, a satisfactory schedule can be gradually achieved. The uniqueness of this approach is characterised by the flexibility of the process planning strategy, which makes full use of the plan solution space intuitively to achieve a satisfactory schedule. Several examples are presented to confirm the efficacy and the effectiveness of the developed integration system.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
References:
| [1] | DOI: 10.1080/00207549008942866 · doi:10.1080/00207549008942866 |
| [2] | Baker KR, Introduction to sequencing and scheduling (1974) |
| [3] | DOI: 10.1177/1063293X9600400102 · doi:10.1177/1063293X9600400102 |
| [4] | DOI: 10.1080/00207540600786715 · Zbl 1128.90493 · doi:10.1080/00207540600786715 |
| [5] | DOI: 10.1080/002075499190365 · Zbl 0949.90583 · doi:10.1080/002075499190365 |
| [6] | DOI: 10.1007/s001700200105 · doi:10.1007/s001700200105 |
| [7] | DOI: 10.1016/S0305-0548(96)00052-4 · Zbl 0889.90090 · doi:10.1016/S0305-0548(96)00052-4 |
| [8] | DOI: 10.1016/0965-9978(95)00080-1 · doi:10.1016/0965-9978(95)00080-1 |
| [9] | DOI: 10.1007/BF01471363 · doi:10.1007/BF01471363 |
| [10] | DOI: 10.1016/S0305-0548(02)00063-1 · Zbl 1049.90026 · doi:10.1016/S0305-0548(02)00063-1 |
| [11] | DOI: 10.1080/002075400411420 · doi:10.1080/002075400411420 |
| [12] | DOI: 10.1007/BF01179808 · doi:10.1007/BF01179808 |
| [13] | Morton TE, Heuristic scheduling systems: with applications to production systems and project management (1993) |
| [14] | DOI: 10.1016/0925-5273(95)00086-0 · doi:10.1016/0925-5273(95)00086-0 |
| [15] | DOI: 10.1109/TSMCC.2006.874022 · doi:10.1109/TSMCC.2006.874022 |
| [16] | DOI: 10.1023/A:1008952024606 · doi:10.1023/A:1008952024606 |
| [17] | Tonshoff, HK, Beckendroff, U and Anders, N. FLEXPLAN–A concept for intelligent process planning and scheduling. Proceedings of CIRP international workshop on computer aided process planning. 21–22 September1989, Hanover. Germany: Hanover University. |
| [18] | DOI: 10.1287/mnsc.33.8.1035 · doi:10.1287/mnsc.33.8.1035 |
| [19] | DOI: 10.1080/00207540500409723 · Zbl 1095.90047 · doi:10.1080/00207540500409723 |
| [20] | DOI: 10.1080/09511929408944623 · doi:10.1080/09511929408944623 |
| [21] | DOI: 10.1080/0020754021000037874 · Zbl 1064.90539 · doi:10.1080/0020754021000037874 |
| [22] | DOI: 10.1016/S0007-8506(07)62357-9 · doi:10.1016/S0007-8506(07)62357-9 |
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.
