A single machine batch processing problem with release dates to minimize the total completion time (1|rj,batch| ƩCj) is investigated in this research. An original mixed integer linear programming (MILP) model is proposed to optimally solve the problem. Since the research problem at hand is shown to be NP-hard, several different meta-heuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) are used to solve the problem. To find the most performing heuristic optimization technique, a set of test cases ranging in size (small, medium, and large) are randomly generated and solved by the proposed meta-heuristic algorithms. An extended comparison analysis is carried out and the outperformance of a hybrid meta-heuristic technique properly combining PSO and genetic algorithm (PSO-GA) is statistically demonstrated

Single machine batch processing problem with release dates to minimize total completion time

Costa A.
2018-01-01

Abstract

A single machine batch processing problem with release dates to minimize the total completion time (1|rj,batch| ƩCj) is investigated in this research. An original mixed integer linear programming (MILP) model is proposed to optimally solve the problem. Since the research problem at hand is shown to be NP-hard, several different meta-heuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) are used to solve the problem. To find the most performing heuristic optimization technique, a set of test cases ranging in size (small, medium, and large) are randomly generated and solved by the proposed meta-heuristic algorithms. An extended comparison analysis is carried out and the outperformance of a hybrid meta-heuristic technique properly combining PSO and genetic algorithm (PSO-GA) is statistically demonstrated
File in questo prodotto:
File Dimensione Formato  
IJIEC_2017_28.pdf

accesso aperto

Tipologia: Versione Editoriale (PDF)
Dimensione 462.04 kB
Formato Adobe PDF
462.04 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11769/330578
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? 11
social impact