Personal Rapid Transit (PRT) is a public transportation mode, in which small automated vehicles transport passengers on demand. Central control of the vehicles leads to interesting possibilities for optimized routings. The complexity of the involved routing problems together with the fact that...

The emergence of the “sustainable development” concept as a response to the mining of natural resources for the benefit of multinational corporations has advanced the cause of long-term environmental management. A sustainable development model (SDM) framework that is inclusive of the...

Selecting the appropriate firm is of paramount importance especially when using a unique delivery method such as construction management at risk. In addition to general contracting services, the construction management at risk firm provides construction management services throughout the design...

Given a seller with <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$k$$</EquationSource> </InlineEquation> types of items, <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$m$$</EquationSource> </InlineEquation> of each, a sequence of users <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$\{u_1, u_2,\ldots \}$$</EquationSource> </InlineEquation> arrive one by one. Each user is single-minded, i.e., each user is interested only in a particular bundle of items. The seller must set the price and assign some amount of bundles to each...</equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation>

Motivated by applications in the manufacturing and service industries, we consider two models for coordinating scheduling with lead-time quotation: a basic model with a single customer type, and an enhanced model where an additional second customer type expects immediate service or production....

We consider the online bounded-batch scheduling to minimize total weighted completion time on parallel machines. In the problem, a set of n independent jobs arriving online over time has to be scheduled on m given machines, where the information of each job including its processing time and...

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...