Solving multi-objective Modified Distributed Parallel Machine and Assembly Scheduling Problem (MDPMASP) with eligibility constraints using metaheuristics

Solving multi-objective Modified Distributed Parallel Machine and Assembly Scheduling Problem (MDPMASP) with eligibility constraints using metaheuristics

We present a new generalization and metaheuristics for the distributed parallel machine and assembly scheduling problem (DPMASP), namely MDPMASP with eligibility constraints. There is a set of unrelated factories or production lines. Each has a series of non-identical parallel machines with varying...

Full description

Bibliographic Details
Main Authors: Ikhlasul Amallynda, Budi Santosa
Format: Article
Language:English
Published: Taylor & Francis Group 2022-12-01
Series:Production and Manufacturing Research: An Open Access Journal
Subjects:
MDPMASP
eligibility constraints
multi-objective problem
mean flow time
the number of tardy
heuristic
Online Access:https://www.tandfonline.com/doi/10.1080/21693277.2022.2070559

Internet

https://www.tandfonline.com/doi/10.1080/21693277.2022.2070559

Similar Items