A multi-objective fixed product flexible open shop problem

This paper introduces a multi-objective fixed product flexible shop scheduling problem with transportation considerations, where workers must move between locations where certain tasks must be performed. Workers are assumed to be heterogeneous with respect to the time required to complete a task and the cost associated with performing a task. The problem is to assign tasks to workers in a way that the following two objectives are minimized: Rhe total amount of time the workers spend traveling between locations and performing tasks, and the total cost of dispatching all workers. A 0-1 mixed-integer linear programming formulation of the problem is provided, and a two-phase heuristic algorithm to find near optimal solutions for large-scale versions of the problem is proposed.