A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server

Bektur G., SARAÇ T.

COMPUTERS & OPERATIONS RESEARCH, cilt.103, ss.46-63, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 103
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1016/j.cor.2018.10.010
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.46-63
  • Anahtar Kelimeler: Unrelated parallel machine scheduling, Scheduling with a common server, Simulated annealing, Tabu search, Sequence-dependent setup times, Dispatching rule, TABU SEARCH ALGORITHM, SINGLE-SERVER, TOTAL TARDINESS, JOBS, MINIMIZE
  • Eskişehir Osmangazi Üniversitesi Adresli: Evet

Özet

Parallel machine scheduling problems with common servers have many industrial applications. In this paper, we study a generalized problem of scheduling with a common server, which is the unrelated parallel machine scheduling problem with sequence-dependent setup times and machine eligibility restrictions. The objective function involves the minimization of the total weighted tardiness. A mixed integer linear programming (MILP) model is proposed to solve this complex problem. Due to the NP hardness of the problem, tabu search (TS) and simulated annealing (SA) algorithms are proposed. The initial solutions of the algorithms are obtained by a modified apparent tardiness cost with setups (ATCS) dispatching rule. The proposed algorithms are compared using a randomly generated data set. (C) 2018 Elsevier Ltd. All rights reserved.