Advanced Search

Query:

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

Format:

Display: entries per page entries

Zbl 0984.90014
Cheng, T.C.E.; Ding, Q.
Single machine scheduling with step-deteriorating processing times. (English)
[J] Eur. J. Oper. Res. 134, No.3, 623-630 (2001). ISSN 0377-2217

Summary: We study in this paper a scheduling model in which each task has a normal processing time which deteriorates as a step function if its starting time is beyond a given deteriorating date. We focus on problems with identical task deteriorating dates. We show that the flow time problem is NP-complete and suggest a pseudo-polynomial algorithm for the makespan problem. We also introduce a general method of solution, which facilitates the identification of solvable cases for some related problems. Finally, we provide a counterexample that invalidates the conjecture of optimality of a switching algorithm reported in the literature. Thus, we solve several unexplored or open problems and obtain a sharp boundary delineating the complexity of the considered problems.

MSC 2000:: *90B35 Scheduling theory
68Q25 Analysis of algorithms and problem complexity

Keywords: sequencing; step-deterioration; computational complexity; scheduling; flow time problem; makespan

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]