Time and space assembly line balancing considers realistic multi-objective versions of the classical assembly line balancing industrial problems. It involves the joint optimisation of conflicting criteria such as the cycle time, the number of stations, and/or the area of these stations. The different problems included in this area also inherit the precedence constraints and the cycle time limit...

this paper considers a two-stage assembly flow shop problem (tafsp) where m machines are in the first stage and an assembly machine is in the second stage. the objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. jit seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...

In this paper, a scheduling algorithm based on deadline time and precedence constraints was developed to schedule hard real-time tasks on multiprocessor systems. The real-time tasks are characterized by their arrival time, deadline time, computation time and precedence constraints. Scheduling problem for these tasks has been solved to determine the order of scheduling tasks on the processors to...

Scheduling wireless links under the SINR model has attracted increasing attention in the past few years [1–6, 8–15, 18–20, 23–25, 27, 28, 33–36, 39, 41, 42, 45, 46]. However, most of previous work did not account for the precedence constraint that might exist among the wireless links. Precedence constraints are common in data aggregation problems where a sensor can not send data to its parent n...

An important feature in Real-time systems is parameter impreciseness, i.e. the inability to accurately determine certain parameter values. The most common such parameter is task execution time. A second feature is the presence of complex relationships between tasks that constrain their execution. Traditional models do not accomodate either feature completely: (a) Variable execution times are mo...

Presented in this paper is an interactive approach of assembly planning. It provides a virtual reality interface for production engineers to program the virtual representation of robotic manipulators in a three-dimensional operation space. The direct human involvement creates a user-defined assembly sequence, which contains the human knowledge of mechanical assembly. By extracting the precedenc...

Most local search algorithms are “perturbative”, incrementally moving from a search state to a neighbouring state while performing noisy hill-climbing. An alternative form of local search is “constructive”, repeatedly building partial solutions using greedy or other heuristics. Both forms have been combined with constraint propagation, and they can be hybridised with each other by perturbing pa...

Resources allocation and scheduling of service workflows is an important challenge in distributed computing. This is particularly true in a cloud computing environment, where many computer resources may be available at specified locations, as and when required. Quality-of-service (QoS) issues such as execution time and running costs must also be considered. Meeting this challenge requires that ...

Scheduling theory as it applies to hard real-time environments with precedence and strict periodicity constraints — environments where the failure to satisfy any constraint may have disastrous consequences [1], [2] — seems currently to be enjoying a renaissance. The most widely studied problems in this field concern periodic non-preemptive tasks for systems where data are collected throught cap...

Compliant assemblies are widely used in automobiles and airplanes etc. In order to simplify the complex assembly sequence planning problem of compliant assemblies involving dimensional variation caused by deformation, a two-step assembly sequence planning method is proposed in this paper. Meanwhile, an example of a wingbox assembly is used to explain the principle of the method. In the first st...