This paper focuses on a stochastic scheduling problem in which n immediately available jobs are to be scheduled jointly with the preventive maintenance in a single machine subject to breakdowns. The objective is to minimize expected total earliness and tardiness costs with a common due-date. The problem of scheduling only n jobs to minimize total earliness and tardiness costs in a single machin...

One of the basic and significant problems that a shop or a factory manager encounters is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is just-in-time scheduling. Motivated by just-intime manufacturing, we consider the multi-objective problem. These objectives minimize total weighted tardiness, earliness and minimize total flow time with fuzzy paramete...

The weighted earliness tardiness parallel machine scheduling problem is NP hard. It is herein approximately solved using a decentralized multi-agent system (MAS). MAS acts as a moderator of two types of agents: free jobs, and groups of jobs assigned to machines. MAS yields good solutions’ quality in reduced run times as evidenced by the computational results. Most importantly, it can be easily ...

Purpose – In order to achieve excellence in manufacturing, goals like lean, economic and quality production with enhanced productivity play a crucial role in this competitive environment. It also necessitates major improvements in generally three primary technical areas: variation reduction, equipment reliability, and production scheduling. Complexity of the real world scheduling problems also ...

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

This paper considers a two-stage assembly flow shop scheduling problem. When all parts of each product are completed in the first stage, they are assembled into a final product on an assembly machine in the second stage. In order to reduce the delivery cost, completed products can be held until completion of some other products to be delivered in a same batch. The proposed problem addresses sch...

We address the problem of determining schedules for static, single-machine scheduling problems where the objective is to minimize the sum of weighted tardiness and weighted earliness. We develop optimal and heuristic procedures for the special case of weights that are proportional to the processing times of the respective jobs. The optimal procedure uses dominance properties to reduce the numbe...

We consider a single-machine scheduling problem with equal-sized jobs. The objective is to minimize the maximum weighted earliness-tardiness and due-date costs. We present an algorithm to solve this problem. Our algorithm makes use of bottleneck jobs and priority queues, and has a computational complexity of O(n logn). This complexity is a significant improvement of the existing algorithm in th...