Recently Koulamas and Kyparisis (2006) introduced past-sequence-dependent setup times to scheduling problems. This means that the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. Koulamas and Kyparisis (2006) were able to show for a number of single-machine scheduling problems with completion time goals that they remain polynomially solvable. In...

This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...

introduction the study of growth parameters such as net assimilation rate (nar), leaf area ratio (lar), relative growth rate (rgr) and leaf area duration (lad) are important for analyzing yield constraints. the growth parameters can be used to understand the crop response to environmental variables during the growing season. the aims of the present study were to 1) consider the growth indices u...

kochia is one of those plants which have capability to grow in different environments and can be used as a valuable plant to produce biomass and seed. the purpose of this study was to evaluate the possibility of kochia planting in different dates as well as its resistance to cold weather of mashhad winter. seven sowing dates including 10th october, november, march, april, may, june and july and...

This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e., their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due...

In this paper, an integrated due date assignment, and delivery scheduling of order for multi customer for make to order production system in supply chain has been survered. One manufacture received n orders from K customers. The due date of orders for each customer is common and manufacture can assign the due dates with a related cost. Orders must be process by one machine and send to customers...

This paper studies the two-machine flowshop scheduling problem with class setups in a no-wait processing environment to minimize the maximum lateness. The jobs are divided into job classes and a setup is required at the initial processing of a job or between the processing of jobs of different classes. In a no-wait environment, a job must be processed from start to finish without interruptions ...

Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots so that successive operations can be overlapped in a multi-stage production system. This paper presents a procedure for minimizing the mean weighted absolute deviation from due dates when jobs are scheduled in a lot-streaming #ow shop. This performance criterion has been shown to be non-regular and requires a...

Dynamic job shop scheduling research has previously assumed that the probability of the customer placing an order is always one, implying that customers will place orders regardless of lead times quoted from the producer and customer lead time expectations. As firms increasingly compete on the basis of the delivery speed and reputation, the relative performance of quoted versus actual realized ...