The problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number c of parts is known to be NP-hard for any c > 0 and c ≤ n, where n is the number of jobs. In this paper we analyze this problem in the context of batch scheduling, i.e, when identical parts must be processed consecutively. In particular we study the ca...

We consider a real-life problem of scheduling clients orders in the production of concrete blocks in a factory of building industry. This problem can be modelled as a hybrid ̄ow shop scheduling problem with mixed no-wait/no-store constraints and mixed bottleneck/non-bottleneck machines. The objective function is to minimize maximum completion time. To solve the problem, we propose an approximat...

This paper describes the design, implementation and deployment of LineKing (LK), a crowdsourced line wait-time monitoring service. LK consists of a smartphone component (that provides automatic, energy-efficient, and accurate wait-time detection), and a cloud backend (that uses the collected data to provide accurate wait-time estimation). LK is used on a daily basis by hundreds of users to moni...

We present a scheduling problem of the flow-shop type. We introduce a transportation system: robot or conveyor. This transportation system is also involved in machine loading and unloading. The studied workshop consists of two machines and a conveyor that must process a set of tasks. Tasks having just been executed wait for the conveyor to be transported. The objective is to determine a feasibl...

flow shop sequencing problem is included in np-hard problems and a number of heuristic methods have been developed to solve it. most of these methods are offered for the crisp processing time. however fuzzy algorithm is appropriate for the problems with fuzzy processing time. this paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

this paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. in the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). however,, two significant criteria for each schedule in stochastic models are: expectable m...

In this paper we deal with solution algorithms for a general formulation of the job shop problem, called alternative graph. We study in particular the job shop scheduling problem with blocking and/or no-wait constraints. Most of the key properties developed for solving the job shop problem with infinite capacity buffer do not hold in the more general alternative graph model. In this paper we re...

This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to...