نتایج جستجو برای: due date assignment scheduling
تعداد نتایج: 1180236 فیلتر نتایج به سال:
This paper investigates single-machine scheduling with a deteriorating maintenance activity, where the processing time of job depends on whether it is handled before or after activity. Under common and slack due date assignments, aim to find optimal schedule, position value (flow-allowance) so that linear weighted sum earliness, tardiness minimized, weights are location-dependent (position-depe...
In this paper we compare simulated annealing and tabu search approaches to a single machine common due date assignment and scheduling problem with jobs available at different times. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs.
We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.
This paper considers single machine scheduling and due date assignment with setup time. The setup time is proportional to the length of the already processed jobs; that is, the setup time is past-sequence-dependent (p-s-d). It is assumed that a job's processing time depends on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs, and the...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید