The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. Th...

This paper is survey of hybrid flow shop scheduling problems. An HFS scheduling problem is a classical flow-shop in which parallel machines are available to perform the same operation. Most real world scheduling problems are NP-hard in nature. The hybrid flow shop scheduling problems have received considerable research attention. The several optimization and heuristic solution procedures are av...

A discrete whale optimization algorithm (DWOA) is presented to solve the no-wait flow shop scheduling problem (NWFSSP) with objective makespan. An effective combination of nearest neighbor (NN) and standard deviation heuristics (SDH) used acquire initial solutions population. After that, three crossover operators, two-point (TPX), multiple-point (MPX) job-based (JBX) are designed mimics humpbac...

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...

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...