论文信息 - Single-machine sequencing with controllable processing times

Single-machine sequencing with controllable processing times

Abstract We consider a static single-machine sequencing problem which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness cost, and total processing cost.

S. S. Panwalkar | S. S. Panwalkar | R. Rajagopalan | S. Panwalkar | R. Rajagopalan

[1] Timothy D. Fry,et al. A framework for single machine multiple objective sequencing research , 1989 .

[2] T.C.E. Cheng,et al. Survey of scheduling research involving due date determination decisions , 1989 .

[3] Horst A. Eiselt,et al. Solution structures and sensitivity of special assignment problems , 1984, Comput. Oper. Res..

[4] P Dileepan,et al. Bicriterion static scheduling research for a single machine , 1988 .

[5] T. C. Edwin Cheng. A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem , 1990, Comput. Oper. Res..

[6] Raymond G. Vickson,et al. Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .

[7] James R. Evans. The Factored Transportation Problem , 1984 .

[8] S. S. Panwalkar,et al. Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[9] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .