Scheduling jobs on a single machine to maximize the total revenue of jobs

In today's hyper-competitive marketplace, many products like memory chips and computers are characterized by short life cycles and rapidly declining sales prices. This implies that the amount of revenue generated as a result of completing a product (job) may be decreasing as its completion time is delayed. In such an environment, there is a decided preference for the maximization of product revenues as an important objective. Based on the assumption that the decreasing rate of revenue is dependent on their product types, we intend to develop a searching algorithm and some heuristic algorithms to locate optimal and near-optimal job sequences, respectively, and thereby maximize total earned revenue.

[1]  W. Townsend.  The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution , 1978 .

[2]  A. H. Russell.  Cash Flows in Networks , 1970 .

[3]  Bahram Alidaee.  Single machine scheduling with nonlinear cost functions , 1991, Comput. Oper. Res..

[4]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[5]  John J. Kanet,et al.  Minimizing Variation of Flow Time in Single Machine Systems , 1981 .

[6]  M. Posner.  Reducibility among single machine weighted completion time scheduling problems , 1991 .

[7]  Gerhard J. Woeginger.  An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine , 1999, INFORMS J. Comput..

[8]  Erik Demeulemeester,et al.  Project network models with discounted cash flows a guided tour through recent developments , 1997, Eur. J. Oper. Res..

[9]  Michael H. Rothkopf,et al.  Technical Note - There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs , 1984, Oper. Res..

[10]  B. D. Sivazlian,et al.  Minimization of Time-Varying Costs in Single-Machine Scheduling , 1978, Oper. Res..

[11]  Joseph G. Szmerekovsky.  Single machine scheduling under market uncertainty , 2007, Eur. J. Oper. Res..

[12]  Bahram Alidaee.  Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost , 1993 .

[13]  Alan G. Merten,et al.  Variance Minimization in Single Machine Sequencing Problems , 1972 .

[14]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .