This paper studies the problem of scheduling Job shops in robotic cells with no intermediate buffers, called No Wait Blocking Transport Job Shop Scheduling Problem (NWBT JSSP). This problem is an extension of the classical job shop problem. No Wait Blocking Transport job shop problems arise in many realistic production environments. To tackle this problem, we developed a Mixed Integer Linear Pr...

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

No wait flow shop scheduling problem (NWFSP) by minimizing make-span is an NP-hard problem with various applications in the industry. In this paper a new lower bound for NWFSP is presented. For this, the MIP model of the problem is relaxed and dived into two separate problems with polynomial solution. Then by applying Lagrangian relaxation method an algorithm is present to obtain a lower-bound....

In this paper, we address the problem of production systems having two characteristics. First, the manufacturing times can be chosen between given bounds. Such a production system is said to have controllable processing times. Second, an operation must start as soon as the previous operation on the same part (if any) is completed. A production system having this characteristic is said to be no-...

We consider the ordinary NP-hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An O(n) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, European Journal of Operational Research 221 (2012),...

We consider the problem of minimizing makespan in a no-wait flow-shop with an arbitrary number of machines. We assume that all sublots have the same number of items. We consider the cases with or without loading times. In both cases we show the existence of a critical machine which never remains idle. Then we get a set of general conditions on the processing times and loading times, which bind ...