본문 바로가기
  • Home

An efficient algorithm for scheduling parallel machines with multiple servers

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2014, 19(6), pp.101-108
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Kyun Rak Chong 1

1홍익대학교

Accredited

ABSTRACT

The parallel machine scheduling is to schedule each job to exactly one parallel machine so thatthe total completion time is minimized. It is used in various manufacturing system areas such assteel industries, semiconductor manufacturing and plastic industries. Each job has a setup phaseand a processing phase. A removal phase is needed in some application areas. A processing phaseis performed by a parallel machine alone while a setup phase and a removal phase are performedby both a server and a parallel machine simultaneously. Most of previous researches used a single server and considered only a setup phase and a processing phase. If a single server is used forscheduling, the bottleneck in the server increases the total completion time. Even though thenumber of parallel machines is increased, the total completion time is not reduced significantly. Inthis paper, we have proposed an efficient algorithm for the parallel machine scheduling usingmultiple servers and considering setup, processing and removal phases. We also have investigatedexperimentally how the number of servers and the number of parallel machines affect the totalcompletion time.

Citation status

* References for papers published after 2023 are currently being built.