In the job shop scheduling problem (JSP), a set of N jobs = {J1, J2, . . . , JN} is to be processed on a set of m machines M = {1, 2, . . . ,m}. Each job requires a sequence of operations that must be accomplished according to its manufacturing process Ji = {Oi1, Oi2, . . . , Oim}. Operation Oij requires a processing time of pij time units on machine Mij ∈ M . Each machine can perform at most o...

The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for im...

This paper concerns sensitivity analysis of a class of complex job shop scheduling problems which are characterized by: (1) a large number of jobs and machines, (2) uncertain jobs processing times, and (3) multiple measures of schedule performance including average weighted tardiness, the number of tardy jobs, the total setup times, the total idle time of machines, and the total flow times of j...

We study the problems of scheduling jobs, with different release dates and equal processing times, on two types of batching machines. All jobs of the same batch start and are completed simultaneously. On a serial batching machine, the length of a batch equals the sum of the processing times of its jobs and, when a new batch starts, a constant setup time s occurs. On a parallel batching machine,...

This paper involves the study of a simulation based proactive decision support module for the shop-floor scheduling of the Plastic Processing Section (PPS) at Bharti Telecom Limited, Gurgaon, India. The flow of material and information in this shop is highly complex as it involves multiple product parts, sequence dependent setup, molding machine specifications, mould restrictions etc. with a va...

This paper investigates a novel flexible job-shop scheduling problem, where the machines have batch-processing capacity, but incompatible jobs cannot be processed in batch (FJSPBI) simultaneously. problem has wide applications discrete manufacturing, especially chemical and steel casting industries. For first time, this study, 3-indexed mixed-integer linear programming (MILP) model is proposed,...

In 1980 Miyazaki considered the weight of a job in which weight shows the relative priority over some other job in a sequencing of different jobs. After that some researchers such as Ghanshiam Das, Singh and Singhal [1981], Panwalker [1991] Sotskov, Allahverdi and Lai [2000], Chandramouli (2005) and Belwal, Mittal (2008) had considered the idea of N-job 2 machine flow shop scheduling problem wi...