In this paper, the problem of minimizing maximum cost and makespan simultaneously on an unbounded parallel-batching machine is considered. An unbounded parallel-batching machine is a machine that can handle any number of jobs in a batch and the processing time of a batch is the largest...

It is well-known that a single machine scheduling problem of minimizing the total tardiness is NP-hard. Recently, Liu, Ng and Cheng solved some special hierarchical minimization problems with total tardiness as the primary criterion by the Algorithm TAP (Two Assignment Problems) in O(n3) time....

We study a scheduling problem with rejection on a single serial batching machine, where the objectives are to minimize the total completion time and the total rejection cost. We consider four different problem variations. The first is to minimize the sum of the two objectives. The second and the...

In real world scheduling systems, task or job attributes are stochastic and sequence dependent, learning improves attributes, and schedulers use their cost (or disutility) functions to evaluate schedules with respect to multiple criteria. This paper addresses a stochastic bicriteria single...

In this paper we introduce the concept of online tradeoff scheduling to minimize two objective functions f1 and f2 simultaneously. An online algorithm A is called (ρ1,ρ2)-competitive for minimizing f1 and f2 if A is ρ1-competitive for minimizing f1 and ρ2-competitive for minimizing f2. A...

Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some function of the job completion times. If preemption is not allowed, then most problems are not only NP-hard, but also very hard from a practical point of view. In this paper, we show that strong...

We focus on backup agreements between a catalog company and manufacturers---a scheme to provide upstream sourcing flexibility for fashion merchandise. A backup agreement states that if the catalog company commits to a number of units for the season, the manufacturer holds back a constant...

In this article the results of a comprehensive empirical study of 1,200 Polish online stores are presented. It was focused on elements that affect the lead time: information about the availability of goods, about the exact stocks and about the declared delivery time. The significant differences...

The purpose of the study was to investigate the role of effective buyer supplier relationship on supply chain performance in Kenya. The study objectives were to identify how lead time, quality, cost and employee morale affects effective buyer supplier relationship on supply chain performance in...