Abstract: Research on due date oriented objectives in the parallel machine environment is at best scarce compared to objectives such as minimizing the makespan or the completion time related performance measures. Moreover, almost all existing work in this area is focused on the identical parallel machine environment. In this study, we leverage on our previous work on the single machine total we...

The rapid rise in popularity of multimedia applications, such as VoIP, IPTV and Video Conferencing, intensifies the need to consider resource management for user satisfaction. Furthermore, improving Quality of Experience (QoE) in Software Defined Networks (SDNs) services is one of the important issues to be addressed by provisioning optimum resource management. In this paper, resource allocatio...

The rapid rise in popularity of multimedia applications, such as VoIP, IPTV and Video Conferencing, intensifies the need to consider resource management for user satisfaction. Furthermore, improving Quality of Experience (QoE) in Software Defined Networks (SDNs) services is one of the important issues to be addressed by provisioning optimum resource management. In this paper, resource allocatio...

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

This paper addresses the single-machine scheduling problem with learning effects and exponential past-sequence-dependent delivery times. The objective is to determine an optimal job schedule such that total weighted completion time maximum tardiness are minimized. To solve general case of problem, we propose heuristic, simulated annealing branch-and-bound algorithms. computational experiment al...

In this study, we consider single-machine scheduling problems with past-sequence-dependent (denoted by psd) setup times in which the of jobs are proportional to length already processed jobs. Under common (CON) and slack (SLK) due-date assignment methods, prove that weighted sum earliness, tardiness minimization remains polynomially solvable. We also give some extensions for psd times.

We consider the problem of allocating a single server to families of jobs with random service times and due dates. Furthermore, a setup is required when the server switches from one job family to another. We address the problems of minimizing expected weighted ow time, expected maximum lateness, and total weighted tardiness with emphasis on problems for which it is assumed that each family can ...

This research presents a formal model of the one machine job shop scheduling problem with variable machine and labor capacity. Primary interest is focused on the trade-off between overtime and detailed scheduling costs. The detailed scheduling problem considered is minimizing the sum of weighted tardiness and weighted flow-time costs for a given capacity plan (e.g., a given overtime schedule). ...

This scheduling model is derived from the real problem of scheduling looms in a textile industry. Jobs may be independently split over several specified machines and preemption is allowed. Deadlines are specified for each job and jobs are assumed to be available. It is shown that minimizing maximum weighted tardiness can be done in polynomial time. The case of uniform machines (as in the consid...