Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms
This paper studies the distributed blocking flow shop scheduling problem (DBFSP) using metaheuristics. A mixed integer programming model for solving the problem is proposed, and then three versions of the hybrid iterated greedy algorithm (HIG<sub>1</sub>, HIG<sub>2</sub>, and HIG<sub>3</sub>) are de...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
IEEE
2017-01-01
|
| Serie: | IEEE Access |
| Soggetti: | |
| Accesso online: | https://ieeexplore.ieee.org/document/8000578/ |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|