Subject
Now showing items 1-4 of 4
-
An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems
(Elsevier, 2021-06)Distributed flow shop scheduling is a very interesting research topic. This paper studies the distributed permutation flow shop scheduling problem with mixed no-idle constraints, which have important applications in practice. ... -
Propose a Polynomial Time Algorithm for Total Completion Time Objective
(INT JOURNAL MATHEMATICAL ENGINEERING & MANAGEMENT SCIENCES-IJMEMS, 2021-06)In this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time. This work has more than one motivation. First, jobs are assigned to machines ... -
Propose a Polynomial Time Algorithm for Total Completion Time Objective
(Engineering and Management Sciences, 2021-06)n this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time. This work has more than one motivation. First, jobs are assigned to machines in ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
