Scheduling involving no-wait in process plays an important role in industries such as plastic,
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …

This article is a comprehensive review of Branch-and-Bound algorithms for solving flowshop
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …

The first comprehensive survey paper on scheduling problems with separate setup times or
costs was conducted by [Allahverdi, A., Gupta, JND, Aldowaisan, T., 1999. A review of …

This paper presents a literature review of flow-shop scheduling problems with transportation
or delivery of jobs. Flow-shop scheduling problems are one of the most widely studied …

This paper considers the m-machine no-wait flowshop problem with the objective of
minimizing the maximum lateness where setup times are considered as separate from …

One of the most important decisions in any manufacturing company is how to schedule the
operations on the available machines. In several industries, the nature of the job imposes …

In this paper, we study the two-machine no-wait flow shop scheduling problem with two
competing agents. The objective is to minimize the overall completion time of one agent …

In this paper we investigate the m-machine permutation flow shop scheduling problem
where exact time lags are defined between consecutive operations of every job. This …

Dans ce mémoire, je présente une synthèse de mes travaux de recherche ainsi que le choix
des thèmes étudiés. J'ai choisi de présenter trois thèmes. Les résultats obtenus pour chaque …