In this research article, scheduling a casting sequence in a job-shop type foundry involving a variety of casts made of an identical alloy but with different shapes and weights, has been investigated. The objective is to produce the assigned mixed order

  This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent

This paper discusses a scheduling problem on object-oriented developments over multiple teams with limited resources in matrix organization. The objective of the problem is to minimize the makespan of overall projects. There are tangible and intangible advantages such as efficient resource share, improvement of productivity, development efforts and cost reduction, etc. by dispatching resources properly to the development teams. Traditionally, the project scheduling has been done with a manager's intuition or heuristic. We present a scheduling model with illustrative examples, stochastic search approach, and apply a variety of problems generated randomly to the approach. The results are analysed.

  This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled a

  In this paper, we propose sludge collection strategies which allocate each sewage store of village to sewage treatment plants and decide the schedule of sludge collection in order to collect sludge efficiently. The strategies aim to decrease transportat

  HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Ser

  This paper considers an assembly-type flowshop scheduling problem in which each job is assembled with two types of components. One type of the components is outsourced with positive lead time but the other type is fabricated in-house at the first stage.

  여러 형태의 고객이 외부로부터 포아송과정에 따라 각 대기행렬에 도착하고 정해진 서비스규칙에 따라 해당 서비스를 받은 후 마코비안 확률분포에 따라 시스템을 떠나거나 다른 형태의 고객으로 시스템을 다시 돌아 올 수도 있는 M/G1 대기행렬시스템을 고려한다. 본 연구에서는 기존의 연구 모형을 확장하여 계층적 서비스 규칙을 갖는 우선순위 대기행렬모형을 제시하고 이에 대한 시스템 성능척도를 보다 체계적으로 구할 수 있는 방법을 소개한다. 이를 위하여 먼저 대

시간과 공간의 제약을 받지 않는 초고속 무선 인터넷 사용을 목표로 하는 휴대 인터넷 시스템이 곧 상용화될 예정이다. 휴대 인터넷 시스템은 서로 다른 특성을 가지고 있는 UGS(Unsolicited Grant Service), rtPS(real time Polling Service), nrtPS(non-real time Polling Service), 그리고 BE(Best Effort)의 네 가지 서비스들을 동시에 제공하므로 이들의 QoS(Quality of Service)를 고려하면서 한정된 무선 채널을 효율적으로 할당하는 스케줄링 알고리즘이 필요하다. 본 연구에서는 처리해야 할 트래픽을 시계열 데이터로 하여 비모수 검정법을 적용하는 새로운 알고리즘을 제안한다. 다양한 파라미터 값들에 대한 스케줄링 기법의 성능을 평가할 수 있는 시뮬레이터를 이용하여 패킷의 지연시간, 데이터 전송률, 폐기 패킷수, 그리고 채널 이용률 등을 평가척도로 하여 제안 방법의 성능을 평가하였다.

Scheduling of dismantling old research reactor need to consider time, cost and safety for the worker. The biggest issue when dismantling facility for research reactor is safety for the worker and cost. Large portion of a budget is spending for the labor cost. To save labor cost for the worker, reducing a lead time is inevitable. Several algorithms applied to reduce read time, and safety considered as the most important factor for this project. This research presents three different dismantling scheduling scenarios. Best scenario shows the specific scheduling for worker and machine, so that it could save time and cost.

  This study considers the problem of scheduling jobs on uniform parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact t

  This paper proposes a real-time resource allocation algorithm for minimizing the completion time of overall workflow process. The jobs in a workflow process are interrelated through the precedence graph including Sequence, AND, OR and Loop control struc

This paper considers a job shop environment where machines are shared by several sub-production systems. The local objective of a sub-production system is the minimization of total completion time. In a centralized environment, a single decision maker has complete information of processing time, job routing and local objectives. In this case, the problem is a traditional job shop scheduling problem to minimize the total completion time which is well-known NP-hard problem. Meanwhile, it is assumed that no sub-production system has a complete view of the entire system in a distributed environment. This paper proposes a distributed scheduling methodology that maintains autonomy of each sub-production system while pursuing system-wide performance in job shop environment. The proposed method is compared to the performance of centralized solutions.

This paper considers a single machine scheduling problem where the machine is shared by multiple sub-production systems. Each sub-production systems has heterogeneous local objectives (e.g., minimization of total completion time, maximum tardiness and makespan). In a distributed manufacturing environment, no sub-production system has complete information (e.g., processing time, due date) of the entire system. This paper provides a distributed scheduling method to find close-to-optimal coordination on the shared machine using minimum local information sharing among sub-production systems. The proposed method is compared to pareto solution that can be found in a centralized environment.

This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines, motivated by a problem commonly found in the surface-mount technology of electronic assembly lines. A rate-modifying activity involving repair, maintenance and readjust is an activity that changes the production rate of equipment under consideration. In this paper, the processing time of a job scheduled before the activity is equal in each parallel machines. On the other hand, if the job is scheduled after the rate-modifying activity than the process time depends on the modifying rate of the activity. Our purpose is to schedule the rate-modifying activities and jobs to minimize the makespan on parallel machines which is NP-hard. We propose a branch and bound algorithm to solve medium size problems optimally. Also we develop three heuristics, Modified Longest Processing Time (MLPT), MULTIFIT and COMBINE algorithms to solve large size problems.

This study presents the new dispatching rules of job shop scheduling with auxiliary resource constraint to improve the schedule performance measures related to completion time and due dates. The proposed dispatching rules consider the information of total

This research considers the problem of scheduling Jobs on unrelated parallel machines with a common due date The objective is to minimize the total absolute deviation of Job completion times about the common due date. This problem is motivated by the fact

This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors simultaneously Meta-heuristic generally finds a good solution If It starts from a good solution In this paper, a tabu