Advanced Search

Query:

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

Format:

Display: entries per page entries

Zbl 0717.90034
Kunnathur, Anand S.; Gupta, Sushil K.
Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. (English)
[J] Eur. J. Oper. Res. 47, No.1, 56-64 (1990). ISSN 0377-2217

The authors consider single machine sequencing problems in which processing time of a job is assumed to be split in a fixed and a variable part. For each job j, the variable part is sequence dependent in the sense that it is given by $\max \{0,v\sb j(S\sb j-d\sb j)\}$ where $v\sb j$ and $d\sb j$ are given and $S\sb j$ is the starting time of job j in the sequence under consideration. The objective is to minimize makespan. \par A dynamic programming, a branch-and-bound and five heuristic algorithms are proposed. Computational experience with solving randomly generated problems with up to 15 jobs is reported. The paper suffers from such annoying phenomena as unstated assumptions and ambiguous formulations.
[M.Vlach]

MSC 2000:: *90B35 Scheduling theory
90C39 Dynamic programming
90-08 Computational methods (optimization)

Keywords: makespan minimization; single machine sequencing; branch-and-bound; heuristic

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]