Single machine scheduling with flow allowances

Journal of the Operational Research Society

Volumn 47, Issue 10, 1996, Pages 1280-1285

  Adamopoulos, George I ^a   Pappis, Costas P ^a  

^a UNIVERSITY OF PIRAEUS   (Greece)

Author keywords

Flow allowance; Scheduling; SLK due date determination method

Indexed keywords

ALGORITHMS; JOB ANALYSIS; OPERATIONS RESEARCH; PARALLEL PROCESSING SYSTEMS; RESOURCE ALLOCATION; SCHEDULING; SEQUENTIAL MACHINES;

COST FUNCTION; FLOW ALLOWANCE; PARALLEL MACHINES; SINGLE MACHINE SCHEDULING; SLACK TIME DUE DATE DETERMINATION;

OPTIMIZATION;

EID: 0030268834     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.155     Document Type: Article

References (15)

1. K. R. Baker and G. D. Scudder (1989) On the assignment of optimal due dates. J. Opl Res. Soc. 40, 93-95.
2. T. C. E. Cheng (1989) Optimal assignment of slack due-dates and sequencing in a single machine shop. Appl. Maths Letters 2, 333-335.
3. T. C. E. Cheng (1989) On a generalized optimal common due-date assignment problem. Engng Optimization 15, 113-119.
4. Y. S. Gordon (1993) A note on optimal assignment of slack due-dates in single-machine scheduling. Eur. J. Opl Res. 70, 311-315.
5. N. I. Karacapiledis and C. P. Pappis (1993) Optimal due-date determination and sequencing of n jobs on a single machine using the SLK method. Computers in Industry 21, 335-339.
6. S. C. Sarin, E. Erel and G. Steiner (1991) Sequencing jobs on a single machine with a common due date and stochastic processing times. Eur. J. Opl Res. 51,188-198.
7. Y. P. Gupta, C. R. Bector and M. C. Gupta (1990) Optimal schedule on a single machine using various due-date determination methods. Computers in Industry 15, 245-254.
8. N. I. Karacapilidis and C. P. Pappis (1995) Optimal algorithms for a class of single machine weighted lateness scheduling problems using due-date determination methods. Yugoslav J. Opns Res. 5, 289-297.
9. G. I. Adamopoulos and C. P. Pappis (1996) Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method. Eur. J. Opl Res. 88, 336-344.
10. S. S. Panwalkar, M. L. Smith and A. Seedmann (1982) Common due-date assignment to minimize total penalty for the one machine sequencing problem. Opns Res. 30, 391-399.
11. T. C. E. Cheng (1989) A heuristic for common due-date assignment and job scheduling on parallel machines. J. Opl Res. Soc. 40,1129-1135.
12. N. I. Karacapiledis and C. P. Pappis (1995) Form similarities of the CON and SLK due date determination methods. J.Opl Res. Soc. 46, 762-770.
13. G. H. Hardy, J. E. Littlewood and G. Polya (1986) Inequalities. Cambridge University Press, New York.
14. B. Aledaee and S. S. Panwalkar (1993) Single stage minimum absolute lateness problem with a common due date on non-identical machines. J. Opl Res. Soc. 44, 29-36.
15. H. Emmons (1987) Scheduling to a common due date on parallel uniform processors. Naval Res. Logist. 34, 803-810.