Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval

In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval. We aim to minimize the makespan when every job has a positive tail. We propose a polynomial approximation algorithm with a worst-case performance ratio of 3/2 for this...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 17; číslo 2; s. 117 - 133
Hlavní autor:	Kacem, Imed
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.02.2009 Springer Springer Verlag
Témata:	Applied sciences Combinatorics Computer Science Convex and Discrete Geometry Exact sciences and technology Flows in networks. Combinatorial problems Inventory control, production control. Distribution Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Scheduling, sequencing Theory of Computation Scheduling Makespan Approximation Non-availability constraint Availability Polynomial approximation Worst case method Minimization Polynomial method Approximation algorithm Combinatorial optimization Polynomial time Scheduling . Non-availability constraint . Approximation Dynamic programming Single machine
ISSN:	1382-6905, 1573-2886
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!