This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup and removal times. The processing of each job includes at most two operations that have to be non-preemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially solvable...

In this paper, we address the feasibility issue in the job shop scheduling problem involving sequence dependent setup times and reentrancy. Feasibility properties are first developed for metaheuristic search methods. In addition, we present a modified version of the standard labelling algorithm. An alternative algorithm is also developed which requires negligible computing time and can directly...

This paper demonstrates solving the flexible flow shop scheduling problem (FFSP) with considering limited waiting time constraint, sequence dependent setup times and different ready time to minimize maximum completion time (i.e. makespan). Since the problem studied is NP-hard, metaheuristic algorithms are proper to solve this class of problems. Hence, in this 1 / 4

In this paper we address a scheduling problem taken from a label sticker manufacturing company. The production system is a two-stage hybrid flow shop with the characteristics of sequence-dependent setup time at stage 1, dedicated machines at stage 2, and two due dates. The objective is to schedule one day’s mix of label stickers through the shop such that the weighted maximal tardiness is minim...

The assumption of classical shop scheduling problems that each job visits each machine only once (Baker, 1974) is often violated in practice. A new type of manufacturing shop, the reentrant shop has recently attracted attention. The basic characteristic of a re-entrant shop is that a job visits certain machines more than once. For example, in semiconductor manufacturing, consequently, each wafe...

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...