Dedicated parallel flow shop scheduling with line availability constraints
COMPUTERS & INDUSTRIAL ENGINEERING, cilt.222, 2026 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 222
- Basım Tarihi: 2026
- Doi Numarası: 10.1016/j.cie.2026.112329
- Dergi Adı: COMPUTERS & INDUSTRIAL ENGINEERING
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Compendex, INSPEC, DIALNET, Business Source Ultimate (EBSCO), Engineering Source (EBSCO), Technology Collection (ProQuest)
- Gazi Üniversitesi Adresli: Evet
Özet
This study addresses a new scheduling problem with F identical flow shops, each of which has a production line with S stages. There are N jobs, categorized into F disjoint job sets, each of which must be processed by its dedicated flow shop using a permutation sequence at all stages. However, one or more flow shops may be unavailable due to machine breakdowns, worker absenteeism, or preventive maintenance activities. Thus, jobs of an unavailable flow shop must be processed by one of its two adjacent flow shops. We investigate the problem in two cases: (1) the unavailable flow shops are not known in advance, but the total number of available flow shops is known; (2) the unavailable flow shops are known in advance. This problem aims to determine the allocation of jobs of each unavailable flow shop to one of its adjacent flow shops and the job sequence in each available flow shop to minimize the makespan of all job sets. We prove that both cases are strongly NP-hard problems. We formulate mixed-integer linear programming (MILP) models to optimally solve both cases. Furthermore, we propose a local search algorithm to solve the first case. Our computational experiments report the outstanding performances of the proposed models and heuristic algorithms.