This paper provides a simulation model to study the effect of the work-in-process control on due date performance in job shop environment. The due date performance is measured by both the number of tardy jobs and the total tardiness. The simulation runs include different shop configurations (flow shop and general job shop), workloads and sequencing rules. As expected, the results reveal that du...

In the last decade job shop scheduling problems have been subject to intensive research due to their multiple applications. Job shop scheduling is known as a strongly NPcomplete problem. In the job shop scheduling problems, processing times and due dates are very dynamically due to both human and machine resource factors. Fuzzy sets are used to model the uncertain processing times and due dates...

In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is characterized by a fixed order of operations, each of which is to be processed on a specific machine for a specified duration. Each machine can process at most one job at a time and once a job initiates processing on a given machine it must complete processing uninterrupted. A sc...

A hybrid simulated annealing algorithm based on a novel immune mechanism is proposed for the job shop scheduling problem with the objective of minimizing total weighted tardiness. The proposed immune procedure is built on the following fundamental idea: the bottleneck jobs existing in each scheduling instance generally constitute the key factors in the attempt to improve the quality of final sc...

The job shop problem is among the class of NPhard combinatorial problems. This Research paper addresses the problem of static job shop scheduling on the job-based representation and the rule based representations. The popular search techniques like the genetic algorithm and simulated annealing are used for the determination of the objectives like minimizations of the makespan time and mean flow...

Job shop scheduling problems with stochastic processing and sequence-dependent setup times and dynamic arrival of job types are real world and most complex among various scheduling problems. This paper extends the previous work of Sharma and Jain (2015) by assessing the performance of proposed four setups oriented dispatching rules with respect to bench mark dispatching rule taken from literatu...

In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is characterized by a fixed order of operations, each of which is to be processed on a specific machine for a specified duration. Each machine can process at most one job at a time and once a job initiates processing on a given machine it must complete processing uninterrupted. A sc...

This paper deals with a problem of determining lot-sizes of jobs in a real-world job shop-scheduling in the presence of uncertainty. The main issue discussed in this paper is lot-sizing of jobs. A fuzzy rule-based system is developed which determines the size of lots using the following premise variables: size of the job, the static slack of the job, workload on the shop floor, and the priority...