SOLUTION ALGORITHMS FOR SINGLE-MACHINE GROUP SCHEDULING WITH LEARNING EFFECT AND CONVEX RESOURCE ALLOCATION

Solution Algorithms for Single-Machine Group Scheduling with Learning Effect and Convex Resource Allocation

Solution Algorithms for Single-Machine Group Scheduling with Learning Effect and Convex Resource Allocation

Blog Article

This paper deals with a single-machine resource allocation scheduling problem with learning effect and group technology.Under slack due-date assignment, our objective is to determine the optimal sequence A Qualitative Study Exploring Factors Associated with Retention in HIV Care among Women with HIV in a Large HIV Clinic in Lagos, Nigeria, after Implementing the Test and Treat Policy of jobs and groups, optimal due-date assignment, and optimal resource allocation such that the weighted sum of Diet-induced differential effects on plasma lipids secretion by the inositol-requiring transmembrane kinase/endoribonuclease 1α earliness and tardiness penalties, common flow allowances, and resource consumption cost is minimized.For three special cases, it is proved that the problem can be solved in polynomial time.To solve the general case of problem, the heuristic, tabu search, and branch-and-bound algorithms are proposed.

Report this page