The nurse-scheduling is a common problem in hospitals. The problem requires a timetable considering hospital regulations and nurses' demands and preferences. This study proposes an integrated Lexicographic goal programming and dynamic satisfaction function model for solving nurse-scheduling...

The classical scheduling literature considers many problems where a given set of jobs must be processed at minimum cost, subject to various resource constraints. The literature only considers the issue of revenue generation in a very limited way, by allowing a job to remain unprocessed and its...

This paper considers the coordination of pricing and scheduling decisions in a make-to-order environment. Following common industry practice, we assume knowledge of a deterministic demand function that is nonincreasing in price. We consider three alternative measures of scheduling cost: total...

This note shows that, for the combinatorial market goods defined by Wellman et al. (2001), there may not exist an optimal allocation that is in equilibrium. Moreover, this result holds even if the value of each processed job is independent of its completion time. The proposed algorithm for...

In most classical scheduling models, it is assumed that a job is dispatched to a customer immediately after its processing completes. In many practical situations, however, a set of delivery dates may be fixed before any jobs are processed. This is particularly relevant where delivery is an...