论文信息 - Single Machine Scheduling with Flow Allowances

Single Machine Scheduling with Flow Allowances

In this paper, a set of jobs is scheduled using the SLK due-date determination method, according to which all the jobs are given the same flow allowance. The single machine case is considered. The objective function is a cost function including three components, namely flow allowance and weighted earliness and tardiness. An analytical solution is given and an algorithm, which provides optimal solutions, is presented. Finally, the parallel machines case is discussed.

Costas P. Pappis | George I. Adamopoulos | C. Pappis | G. Adamopoulos

[1] Hamilton Emmons,et al. Scheduling to a common due date on parallel uniform processors , 1987 .

[2] Subhash C. Sarin,et al. Sequencing jobs on a single machine with a common due date and stochastic processing times , 1991 .

[3] T. Cheng. ON A GENERALIZED OPTIMAL COMMON DUE-DATE ASSIGNMENT PROBLEM , 1989 .

[4] C. R. Bector,et al. Optimal schedule on a single machine using various due date determination methods , 1990 .

[5] Bahram Alidaee,et al. Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines , 1993 .

[6] T.C.E. Cheng,et al. A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines , 1989 .

[7] T. Cheng. Optimal assignment of slack due-dates and sequencing in a single-machine shop , 1989 .

[8] V. S. Gordon. A note on optimal assignment of slack due-dates in single-machine scheduling , 1993 .