Single-machine scheduling problems with start-time dependent processing time

Computers and Mathematics with Applications

Volumn 53, Issue 11, 2007, Pages 1658-1664

  Kuo, Wen Hung ^a   Yang, Dar Li ^a  

^a NATIONAL FORMOSA UNIVERSITY   (Taiwan)

Author keywords

Completion time; Makespan; Scheduling; Single machine; Time dependent

Indexed keywords

NUMBER THEORY; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING;

COMPLETION TIME; MAKESPAN; SINGLE-MACHINES; TIME DEPENDENT;

SCHEDULING;

EID: 34249306917     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2006.07.012     Document Type: Article

References (7)

1. Alidaee B., and Womer N.K. Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society 50 (1999) 711-729
2. Gupta J.N.D., and Gupta S.K. Single facility scheduling with nonlinear processing times. Computers and Industrial Engineering 14 (1998) 387-393
3. Alidaee B. A heuristic solution procedure to minimize makespan on a single machine with non-linear cost functions. Journal of the Operational Research Society 41 (1990) 1065-1068
4. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals Discrete Mathematics 5 (1979) 287-326
5. Kuo W.H., and Yang D.L. Minimizing the makespan in a single machine scheduling problem with a time-based learning effect. Information Processing Letters 97 (2006) 64-67
6. Kuo W.H., and Yang D.L. Minimizing the total completion time in a single machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research 174 (2006) 1184-1190
7. Townsend W. The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution. Management Science 24 (1978) 530-534