The Effect of Worker Learning on Scheduling Jobs in a Hybrid Flow Shop: A Bi-Objective Approach
This paper studies learning effect as a resource utilization technique that can model improvement in worker’s ability as a result of repeating similar tasks. By considering learning of workers while performing setup times, a schedule can be determined to place jobs that share similar tools and fixtures next to each other. The purpose of this paper is to schedule a set of jobs in a hybrid flow shop (HFS) environment with learning effect while minimizing two objectives that are in conflict: namely maximum completion time (makespan) and total tardiness. Minimizing makespan is desirable from an internal efficiency viewpoint, but may result in individual jobs being scheduled past their due date, causing customer dissatisfaction and penalty costs. A bi-objective mixed integer programming model is developed, and the complexity of the developed bi-objective model is compared against the bi-criteria one through numerical examples. The effect of worker learning on the structure of assigned jobs to machines and their sequences is analyzed. Two solution methods based on the hybrid water flow like algorithm and non-dominated sorting and ranking concepts are proposed to solve the problem. The quality of the approximated sets of Pareto solutions is evaluated using several performance criteria. The results show that the proposed algorithms with learning effect perform well in reducing setup times and eliminate the need for setups itself through proper scheduling.
KeywordsBi-objective scheduling hybrid flow shop learning effect meta-heuristic
Unable to display preview. Download preview PDF.
The authors thank the editor and reviewers fortheir comments, which helped in improving the quality of the paper.
- Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D. & Soukhal, A. (2014). Multiagent scheduling. Berlin Heidelberg: Springer Berlin Heidelberg. Doi, 10(1007):978–3.Google Scholar
- Govindan, K., Balasundaram, R., Baskar, N. & Asokan, P. (2016). A hybrid approach for minimizing makespan in permutation flowshop scheduling. Journal of Systems Science and Systems Engineering, 26 (1): 1–27.Google Scholar
- Jadaan, O., Rajamani, L. & Rao, C. (2008). Non-dominated ranked genetic algorithm for solving multi-objective optimization problems: NRGA. Journal of Theoretical and Applied Information Technology, 4 (1): 61–68.Google Scholar
- Schaffer, J.D. (1985). Multiple objective optimization with vector evaluated genetic algorithms, in: Proceedings of First International Conference on Genetic Algorithms and Their Applications, Carnegie-Mellon University, Pittsburgh, PA, USA, 93–100.Google Scholar