In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...

In bakery production, to perform a processing task there might be multiple alternative machines that have the same functionalities. Finding an efficient production schedule is challenging due significant nondeterministic polynomial time (NP)-hardness of problem when number products, tasks, and are higher. addition, many tasks performed manually as small medium-size bakeries not fully automated....

In this paper, two tools to improve the performance of the NEHbased heuristics for the flow shop problem with and without buffer constraints are proposed. The first tool is the use of the reversibility property of the problems considered and the second one is a new tie-breaking strategy to be use in the insertion phase of the NEH heuristic. In addition, we have analyzed the behavior of five ini...

BACKGROUND The outbreak of the Ebola virus disease (EVD) in West Africa in December 2013 was the largest Ebola outbreak in history. This study aimed to measure the underlying contextual and psychosocial factors of intentions to perform Ebola prevention behaviours (not touching people who might be suffering from Ebola, reporting suspected cases to the National Ebola Hotline, NEH) in Guinea-Bissa...

This paper presents makespan algorithms and scheduling heuristic for an Internet-based collaborative design and manufacturing process using bottleneck approach. The collaborative manufacturing process resembles a permutation re-entrant flow shop environment with four machines executing the process routing of M1,M2,M3,M4,M3,M4 in which the combination of the last three processes of M4,M3,M4 has ...