Contemporary computer systems are multiprocessor or multicomputer machines. This chapter will introduce the basics of multiprocessor scheduling. Consequently, the eld of scheduling for multiprocessor systems.The main motivation for multiprocessor scheduling is the desire for increased. The scheduling problem for multiprocessor systems can be generally stated as.Concurrency implemented by schedu...

Planning has belonged to fundamental areas of AI since its beginning and sessions on planning are an integral part of major AI conferences. By generating activities necessary to achieve some goal, planning is also closely related to scheduling that deals with allocation of activities to scarce resources. Although the planning and scheduling communities are somehow separated, both areas have int...

The effective scheduling of transactions has a great potential for SoC functional verification. Petri nets have proven to be a promising technique for solving scheduling problem. This paper aims at presenting a Petri-net based approach to the scheduling of transactions generated by a test-case generator. Firstly, an extended scheduling timed Petri nets (ESTPN) model is given to support transact...

In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...

Manufacturing scheduling is a complex combinatorial problem, particularly in distributed and dynamic environments. This paper presents a holonic approach to manufacturing scheduling, which in opposite to traditional approaches, distributes the scheduling functions over several entities, combining their calculation power and local optimization. In this scheduling and control approach, the schedu...

This paper proposes a polling-scheduling for UWB-based in-vehicle networks. The proposed scheduling aims to reduce the preamble overhead by aggregating periodic data readout of sensors. Experimental results show that successfully suppresses loss rate compared cyclic scheduling.

this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...

resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. in this study, budget, investment costs and earnings are considered to be stochastic. the objectives are maximizing net present values of selected projects and minimizing v...