Approximation schemes for job shop scheduling problems with controllable processing times

被引：42

作者：

Jansen, K

Mastrolilli, M

Solis-Oba, R

机构：

[1] IDSIA Ist Molle Studi Intelligenza Artificiale, CH-6928 Lugano, Switzerland

[2] Univ Kiel, D-24198 Kiel, Germany

[3] Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2005年 / 167卷 / 02期

基金：

加拿大自然科学与工程研究理事会;

关键词：

scheduling; job shop; controllable processing times; approximation schemes;

D O I：

10.1016/j.ejor.2004.03.025

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing times means that it is possible to reduce the processing time of the jobs by paying a certain cost. We consider two models of controllable processing times: continuous and discrete. For both models we present polynomial time approximation schemes when the number of machines and the number of operations per job are fixed. (c) 2004 Elsevier B.V. All rights reserved.

引用

页码：297 / 319

页数：23