In this paper, we propose a neuro-genetic decision support system coupled with simulation to design a job shop manufacturing system by achieving predetermined values of targeted performance measures such as flow time, number of tardy jobs, total tardiness and machine utilization at each work center. When a manufacturing system is designed, the management has to make decisions on the availabilit...

This paper addresses the job shop scheduling problem to minimize the number of tardy jobs, considering the sequence dependent setup time. This problem is taken as a sequencing problem, and a family of approaches with different levels of intricacy is proposed. The simplest form is a critical ratio-based dispatching rule, which leads to satisfactory solutions by taking into account the group info...

The recent paper ‘‘Single-machine scheduling with general learning functions’’ (Wang [1]) addresses the single-machine scheduling problems with a sum-of-processing-times-based learning effect. The author showed that that the shortest processing time (SPT) rule is optimal for the sum of completion times square minimization problem. He also showed by examples that the optimal schedule for the cla...

This paper presents an integrated approach for scheduling in distributed computing with strategies as sets of job supporting schedules generated by a critical works method. The strategies are implemented using a combination of job-flow and application-level techniques of scheduling within virtual organizations of Grid. Applications are regarded as compound jobs with a complex structure containi...

The paper addresses the problem scheduling a batch processing machine with multiple incompatible job families, non-identical job dimensions, non-identical job sizes and non-agreeable release dates to minimize makespan. The research problem is solved by proposing a mixed integer programming model that appropriately takes into account the parameters considered in the problem. The proposed is vali...

In many real-life applications, it can be often found that multiple agents compete on the usage of a common processing resource in different application environments and different methodological fields, such as artificial intelligence, decision theory, operations research, etc. Moreover, scheduling with multiple agents is relatively unexplored. Based on this observation, this paper attempts to ...

We investigate the problem of minimizing the weighted number of tardy jobs on a single machine subject to availability constraints. We consider the case of semi-resumable jobs (1, hk|ri, sr − a| ∑ wiUi). We show that the problem is equivalent to a similar problem without availability constraints, but where the processing times of jobs are a stepwise function of their starting time. We design a ...