This paper proposes a penalty-shift-insertion (PSI)-based algorithm for the no-wait flow shop scheduling problem to minimize total flow time. In the first phase, a penalty-based heuristic, derived from Vogel’s approximation method used for the classic transportation problem is used to generate an initial schedule. In the second phase, a known solution is improved using a forward shift heuristic...

This paper addresses cyclic scheduling of a no-wait robotic cell with multiple robots. In contrast to many previous studies, we consider r-degree cyclic (r > 1) schedules, in which r identical parts with constant processing times enter and leave the cell in each cycle. We propose an algorithm to find the minimal number of robots for all feasible r-degree cycle times for a given r (r > 1). Conse...

In this researcha particle swarm optimization (PSO) algorithm is proposedfor no-wait flowshopsequence dependent setuptime scheduling problem with weighted earliness-tardiness penalties as the criterion ( | , | ∑ " ).The smallestposition value (SPV) rule is applied to convert the continuous value of position vector of particles in PSO to job permutations.A timing algorithm is generated to find t...

This paper describes a methodology of automatic genetic algorithm parameters adjustment dedicated to a job-shop problem with a no-wait constraint with a makespan criterion. The numerical results show that in a given problem, the efficiency of an algorithm with auto-tuning is placed at the level of an algorithm steered in a classical way with the best-fit steering parameters.

In this paper we present new analytical results concerning long-term staffing problem in high-level telecommunication service systems. We assume that a service system can be modelled either by a classic Mt/Mt/S queue, or Mt/Mt/S queue with batch service or Mt/Mt/S with catastrophes and batch arrivals when empty. The question under consideration is: how many servers guarantee that in the long ru...

The m-machine no-wait flowshop scheduling problem, with the objective of minimizing total completion time subject to the constraint that makespan has to be less than or equal to a certain value, is addressed in this paper. First, an algorithm is proposed to find an upper bound on the makespan in case the upper bound is not given or unknown. Given the upper bound on makespan, a proposed algorith...

The paper considers a two machine flow shop scheduling problem with no wait in process. The objective is to find the optimal values of machine speeds and to determine the time-optimal schedule. There are two machines, A and B, and a set of n jobs each consisting of two operations. The first operation of each job is to be processed on machine A and the second on machine B. For each feasible sche...

This paper describes a hybrid tabu search algorithm dedicated to a job shop problem with a no-wait constraint with a makespan criterion. The proposed here algorithm complexity is that the superior algorithm based on the tabu search technique selects parameters controlling the work of a certain constructional algorithm. This approach limits the checked solutions only to a group of solutions bein...

The issue of sequencing and scheduling has received considerable critical attention in many fields since the early 1950s. In this research, we studied an important production scheduling system, which generally called flexible (or hybrid) flowshop scheduling problem (FFSP or HFSP). We studied this production system with an important restriction called the no-wait. The objective was to optimize t...