Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0976.90039
Bachman, Aleksander; Janiak, Adam
Minimizing maximum lateness under linear deterioration. (English)
[J] Eur. J. Oper. Res. 126, No.3, 557-566 (2000). ISSN 0377-2217

Summary: The paper deals with a single machine scheduling problem, where job processing time is given as a start time dependent linear function. The objective is to find such a schedule (processing order) which minimizes the maximum lateness criterion. We show that the problem is NP-complete and present two heuristic algorithms. An experimental analysis of the proposed algorithms is also given.

MSC 2000:: *90B35 Scheduling theory
90C60 Abstract computational complexity for math. programming problems

Keywords: complexity; scheduling theory; single machine; deteriorating jobs; due date

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]