This paper considers a single machine scheduling problem with several mainte-nances periods. Specically, two situations are investigated. In the rst one, maintenance periods are periodically xed: maintenance is required after a periodic time interval. In the second one, the maintenance is not xed but the maximum continuous working time of the machine which is allowed is determined. The objectiv...

The problem of scheduling n jobs with a large common due date on a single machine is addressed. The objective is to minimize the jobs’ total earliness and tardiness. In this paper, sequence-dependent setup times are considered, which makes the problem NP-Hard. Therefore, exact algorithms are very unlikely to optimally solve large problems within reasonable computational time. A Simulated Anneal...

In this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem.  Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...

Efficient and on-time maintenance plays a crucial role inreducing cost and increasing the market share of an industrial unit. Preventivemaintenance is a broad term that encompasses a set of activitiesaimed at improving the overall reliability and availability of a systembefore machinery breakdown. The previous studies have addressed thescheduling of preventive maintenance. These studies have co...

Traditional machining economics looks into the optimal set of machining conditions under which the production cost or time per part is minimized. No due dates are included in the consideration. Job sequencing searches for the optimal order of jobs so that lateness and/or earliness is minimized. The optimization assumes that processing times are fixed. In practice, processing times are variable ...

Nowadays, manufacturing enterprises face the challenge of just-in-time (JIT) production and energy saving. Therefore, study of JIT production and energy consumption is necessary and important in manufacturing sectors. Moreover, energy saving can be attained by the operational method and turn off/on idle machine method, which also increases the complexity of problem solving. Thus, most researche...

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