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 paper considers minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. After problem formulation, we present a proof to show that the general version of this problem is strongly NP-complete. We then discuss a few polynomially solvable cases of the problem and...