Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...

in this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/i/etmax). due to the time complexity function, this sequencing problem belongs to a class of np-hard ones. thus, a special design of a simulated annealing (sa) method is applied to solve such a hard problem. to comp...

Abstract Most Workload Control literature assumes that delivery performance is determined by tardiness related measures only. While this may be true for companies directly deliver to end-customers, make-to-stock or firms are part of supply chains, producing early often means large inventories in the finished goods warehouse penalties incurred downstream chain. Some earlier studies used a so-cal...

Nowadays, flexible manufacturing system (FMS) is introduced as a response to the competitive environment. Scheduling of FMS is more complex and more difficult than the other scheduling production systems. One of the main factors in scheduling of FMS is variable time of taking orders from customers, which leads to a sudden change in the manufacturing process. Also, some problems are created in p...

Under just-in-time production, this paper studies a single machine common due-window (denoted by CONW) assignment scheduling problem with position-dependent weights and resource allocations. A job’s actual processing time can be determined the assigned to job. allocation model is divided into linear convex models, our goal find an optimal location, job sequence allocation. We prove that weighte...

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

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