in this paper, based on the background of cost-oriented assembly line balancing problems, a novel mathematical model for scheduling and balancing the assembly line is offered that with the combination of task sequence-dependent setup time, parallel stations and resource constraint, minimizes the operational and investment costs of assembly system. due to the complexity of the problem, the equat...

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

Virtual assembly process planning (VAPP) provides a more efficient, intuitive and convenient method for assembly process planning. Previous efforts in this field are concentrated on how to assemble components together and how to analyze this assembly process in a virtual environment. However, how the interactive planning process can be modeled and organized, which is important for VAPP because ...

Job-shop Scheduling Problem (JSP) is one of extremely hard problems because it requires very large combinatorial search space and the precedence constraint between machines. The traditional algorithm used to solve the problem is the branch-andbound method, which takes considerable computing time when the size of problem is large. W e propose a new method for solving JSP using Genetic Algorithm ...

Given a set of m tasks with a precedence constraint P and a communication requirement C, where each task has execution time and a subcube requirement, the Hypercube Task Scheduling Problem (HTSP) is to nd an assignment of tasks which minimizes the total completion time. In this paper, we show that HTSP and its many restricted versions are NP-hard. This motivates the development of heuristic alg...

Virtual prototyping tools have already captivated the industry's interest as a viable design tool. One of the key challenges for the research community is to extend the capabilities of Virtual Reality technology beyond its current scope of ergonomics and design reviews. The research presented in this paper is part of a larger research programme that aims to perform maintainability assessment on...

Workers scheduling in not highly automated production lines is an important task, especially when in a production line the number of operators is less than the number of workstations. Finding an optimal distribution plan can increase the line throughput, managing the workforce and the workload in a better way. This work focuses on the operator-scheduling problem for an electromechanical assembl...

abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...

In this paper, it is investigated how to sequence jobs with fuzzy processing times and predict their due dates on a single machine such that the total weighted possibilistic mean value of the weighted earliness–tardiness costs is minimized. First, an optimal polynomial time algorithm is put forward for the scheduling problem when there are no precedence constraints among jobs. Moreover, it is s...

We study the problem of scheduling groups of tasks with precedence constraints on three dedicated processors. Each task requires a speci3ed set of processors. Up to three precedence constraints are considered among groups of tasks requiring the same set of processors. The objective of the problem is to 3nd a nonpreemptive schedule which minimizes the maximum completion time (makespan). This sch...