A flow shop batch scheduling and operator assignment model with time-changing effects of learning and forgetting to minimize total actual flow time
| Autor: | Dwi Kurniawan, Andi Cakravastia Raja, Suprayogi Suprayogi, Abdul Hakim Halim |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Computer Science::Machine Learning
Problem solving lcsh:Commerce Actual flow time Programació (Ordinadors) lcsh:T55.4-60.8 Strategy and Management Economia i organització d'empreses::Direcció d'operacions [Àrees temàtiques de la UPC] Solució de problemes lcsh:Business Computer programming Industrial and Manufacturing Engineering Batch scheduling Operator assignment lcsh:Social Sciences lcsh:H Time-changing effect lcsh:HF1-6182 ddc:650 Learning-forgetting batch scheduling operator assignment time-changing effect learning-forgetting flow shop actual flow time lcsh:Industrial engineering. Management engineering Flow shop temps real lcsh:HF5001-6182 |
| Zdroj: | Journal of Industrial Engineering and Management, Vol 13, Iss 3, Pp 546-564 (2020) UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) |
| ISSN: | 2013-0953 2013-8423 |
| Popis: | Purpose: This paper aims to investigate simultaneous problems of batch scheduling and operator assignment with time-changing effects caused by learning and forgetting.Design/methodology/approach: A number of parts will be processed in batches, each of which will be processed through a number of operations where there are alternative operators for each operation bringing different set up and processing times as operators experience different degree of learning and forgetting. A mathematical model is developed for the problems, and the decision variables are operator assignment, the number of batches, batch sizes and the schedule of the resulting batches. A proposed algorithm works by trying different number of batches, starting from one, and increasing the number of batches one by one until the objective function value does not improve anymore.Findings: We show both mathematically and numerically that the closest batch to the due date always becomes the largest batch in the schedule, and the faster operators learn, the larger the difference between the closest batch to the due date and the other batches, the lower optimal number of batches, and the lower the total actual flow time.Originality/value: Previous papers have considered the existence of alternative operators but have not considered learning and forgetting, or have considered learning and forgetting but only in a single-stage system and without considering alternative operators. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|