Minimizing maximum lateness under linear deterioration

European Journal of Operational Research

Volumn 126, Issue 3, 2000, Pages 557-566

  Bachman, Aleksander ^a   Janiak, Adam ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; PROCESS CONTROL; PRODUCTION ENGINEERING; SCHEDULING;

JOB PROCESSING TIME; SINGLE MACHINE SCHEDULING PROBLEMS;

PRODUCTION CONTROL;

EID: 0034325430     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00310-0     Document Type: Article

References (8)

1. A. Bachman, A. Janiak, Scheduling jobs with special type of start time dependent processing times, Report No 34/97, Institute of Engineering Cybernetics, Wroclaw University of Technology, Wroclaw, 1997.
2. Browne S., Yechiali U. Scheduling deteriorating jobs on single processor. Operations Research. 38/3:1990;495-498.
3. Garey M.R., Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness. 1979;Freeman, San Francisco.
4. S. Gawiejnowicz, L. Pankowska, Scheduling jobs with time-dependent processing times, Report 027/1995, Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznan, 1995.
5. Jackson J.R. An extension of Johnson's results on job lot scheduling. Naval Research Logistics Quarterly. 3:1956;201-203.
6. Kunnathur A.S., Gupta S.K. Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operational Research. 47:1990;56-64.
7. Mosheiov G. Scheduling jobs under simple linear deterioration. Computers and Operations Research. 21(3):1994;653-659.
8. Sundararaghavan P.S., Kunnathur A.S. Single machine scheduling with start time dependent processing times: Some solvable cases. European Journal of Operational Research. 78:1994;394-403.