A fully polynomial time approximation scheme (FPTAS) with run time O( n m εm−1 ) is developed for a problem which combines common due window assignment and scheduling n jobs on m identical parallel machines. The problem criterion is bottleneck (min-max) such that the maximum cost, which includes job earliness, job tardiness and due window size costs, is minimized.

Message sequencing and channel assignment are two important issues that need to be addressed when scheduling variable-length messages in a wavelength division multiplexing (WDM) network. Channel assignment addresses the problem of choosing an appropriate data channel via which a message is transmitted to a node. This problem has been addressed extensively in the literature. On the other hand, m...

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

In the grid context, the scheduling can be grouped into two categories: offline scheduling and online scheduling. In the offline scheduling scenario, the sequence of jobs is known in advance, scheduling is based on information about all jobs in the sequence. While, in the online scheduling scenario a job is known only after all predecessors have been scheduled, and a job is scheduled only accor...

Many online problems encountered in real-life involve a two-stage decision process: upon arrival of a new request, an irrevocable first-stage decision (the assignment of a specific resource to the request) must be made immediately, while in a second stage process, certain ”subinstances” (that is, the instances of all requests assigned to a particular resource) can be solved to optimality (offli...

It is well-known that there exists a trade-off between crypto-period and affected risk, so the key derivation is not only constrained by the partial-order class relation but also by the time period while handling hierarchical key assignment in dynamic enterprises. In this paper, a new date-constraint hierarchical key assignment scheme, which does not make use of public key cryptosystem, is prop...

the allocation of human resources to project activities in order to schedule them is one of the closest states to the actual conditions of scheduling problems. but regarding the fact that this problem belongs to the class of np-hard problems; so far the exact methods have only been able to solve the small size problems. in this study, the renewable resources are humans in a way that every staff...

the research on project scheduling has widely expanded over the last few decades. the vast majority of these research efforts focus on exact and suboptimal procedures for constructing a workable schedule, assuming complete information and a static deterministic problem environment. project activities are scheduled subject to both technological precedence constraints and resource constraints, mo...

We have created a framework that provides a way to represent a wide range of scheduling and assignment problems across many domains. We have also created an optimizing scheduler that can, without modification, solve any problem represented using this framework. The three components of a problem representation are the metadata, the data, and the scheduling semantics. The scheduler performs the o...

This paper presents an overview of assignment and sequencing models that are used in the scheduling of process operations with mathematical programming techniques. Although scheduling models are problem specific, there are common features which translate into similar types of constraints. Two major categories of scheduling models are identified: single-unit assignment models in which the assign...