论文信息 - V- and GG-shaped properties for optimal single machine schedules for a class of non-separable penalty functions - 字舞流文

V- and GG-shaped properties for optimal single machine schedules for a class of non-separable penalty functions

M. Raghavachari | J. Mittenthal | A. Rana

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

[2] S. S. Panwalkar,et al. Flowshop sequencing problem with ordered processing time matrices: A general case , 1976 .

[3] Samuel Eilon,et al. Minimising Waiting Time Variance in the Single Machine Problem , 1977 .

[4] R. K. Arora,et al. Scheduling in a Semi-Ordered Flow-shop Without Intermediate Queues , 1980 .

[5] M. Raghavachari. A V-shape property of optimal schedule of jobs about a common due date , 1986 .

[6] Yih-Long Chang,et al. Minimizing Mean Squared Deviation of Completion Times About a Common Due Date , 1987 .

[7] Prabuddha De,et al. On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..

[8] Madabhushi Raghavachari,et al. V-shape property for optimal schedules with monotone penalty functions , 1992, Comput. Oper. Res..

[9] M. Raghavachari,et al. Single machine scheduling with coefficient of variation minimization , 1992 .

[10] Wieslaw Kubiak,et al. Completion time variance minimization on a single machine is difficult , 1993, Oper. Res. Lett..

[11] M. Raghavachari,et al. Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties , 1993, Oper. Res..

[12] Madabhushi Raghavachari,et al. A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions , 1993, Comput. Oper. Res..