Original scientific paper We consider several serial batch scheduling problems with outsourcing allowed. Each job can be either processed on the in-house machine or outsourced. The objective is to minimize the weighted sum of the scheduling cost and the total outsourcing cost. We discuss three classical scheduling objective functions. The first is the total completion time, the second is the ma...

This paper considers the uniform parallel machine scheduling problem which is to minimize the maximum lateness. This problem is equivalent to the uniform parallel machine scheduling problem, which is to minimize the maximal completion time of n jobs whose release times are zero, processing times depend on the speed of the machine to which they are assigned, and their delivery times are differen...

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum‡ow based lower bound for the P=rj=Lmax which dominates the well-known preemptive lower bound. We show that, in some cases the proposed bound strictly dominates the preemptive one while having the same complexity.

Abstract This research quantifies the relationship between the cost of earliness and lateness by empirically observing commute trips from two different sources. The first empirical analysis uses individual level travel survey data from six metropolitan regions while the second analysis uses traffic data from the Twin Cities freeway network. The analysis conducted in this research provides a met...

This paper presents a moderation-mediation model suggesting that proactivity and job autonomy moderate the mediating effects of engagement on relationship servant leadership with performance lateness. Data were collected from sample 50 bank departments three sources: managers (n = 50), employees 165), objective data provided by human resources departments. The results show as expected, associat...

We consider the problem of scheduling a number of jobs, each job having a release time, a processing time and a due date, on a single machine with the objective of minimizing the maximum lateness. We developed a hybrid dual-population genetic algorithm and compared its performance with alternative methods on a new diverse data set. Extensions from a single to a dual population by taking problem...

A decomposition-based optimization algorithm is proposed for solving large job shop scheduling problems with the objective of minimizing the maximum lateness. First, we use the constraint propagation theory to derive the orientation of a portion of disjunctive arcs. Then we use a simulated annealing algorithm to find a decomposition policy which satisfies the maximum number of oriented disjunct...

In this paper we develop branch and bound algorithms for a number of hard, two-agent scheduling problems, i.e., problems in which each agent has an objective function which depends on the completion times of its jobs only. We address the minimization of total weighted completion time of the first agent jobs, subject to a bound on the cost function of the second agent, which may be: (i) total we...