Data for: A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion

source data for the paper "A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion&quot

Data for: A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion

source data for the paper "A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterion"THIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOV

Tailored Iterated Greedy metaheuristic for a scheduling problem in metal 3D printing

This article contributes to the additive manufacturing-based production planning literature by developing a Mixed-Integer Linear Programming (MILP) formulation for the Identical Parallel 3D-Printing Machines Scheduling Problem considering batching, multiple build platforms of restricted sizes, and sequence-independent setup times. Besides, a customized metaheuristic, named the Tailored Iterated Greedy (TIG) Algorithm is developed to solve the new optimization problem. TIG’s performance is evaluated through extensive numerical analysis and using a new testbed. It is shown that the customized computational mechanisms improve the optimization performance; statistical analysis is supportive of the significance of the resulting improvements. The developed mathematical model and optimization algorithm can be considered the basis for future developments in the optimization literature of additive manufacturing