Abstract The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of
the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the …

In this paper, JIT (Just-In-Time)-KANBAN literature survey was carried out and presented.
The introductory section deals with the philosophy of JIT, and the concept involved in the …

Scheduling problems have been investigated since the late fifties. Two types of applications
have mainly motivated research in this area: project planning and machine scheduling …

This paper presents a novel hybrid algorithm (TABC) that combines the artificial bee colony
(ABC) and tabu search (TS) to solve the hybrid flow shop (HFS) scheduling problem with …

In this paper, an effective hybrid algorithm based on particle swarm optimization (HPSO) is
proposed for permutation flow shop scheduling problem (PFSSP) with the limited buffers …

This paper proposes an effective hybrid algorithm based on differential evolution (DE),
namely HDE, to solve multi-objective permutation flow shop scheduling problem (MPFSSP) …

As a typical manufacturing and scheduling problem with strong industrial background, flow
shop scheduling with limited buffers has gained wide attention both in academic and …

In this paper, an effective hybrid discrete differential evolution (HDDE) algorithm is proposed
to minimize the maximum completion time (makespan) for a flow shop scheduling problem …

Providing robust scheduling algorithms that can solve a large variety of scheduling problems
with good performance is one of the biggest challenge of practical schedulers today. In this …

A permutation flow shop scheduling problem is reformulated as a mixed-integer linear
program after incorporating flexible and diverse maintenance activities for minimizing total …