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
相关论文
共 50 条
  • [21] Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
    Dvir Shabtay
    Baruch Mor
    Journal of Scheduling, 2024, 27 : 239 - 256
  • [22] Solving Job-Shop Scheduling Problems with Fuzzy Processing Times and Fuzzy Due Dates
    Alejandro Bustos-Tellez, Camilo
    Sebastian Tenjo-Garcia, Jhoan
    Carlos Figueroa-Garcia, Juan
    INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS: THEORY AND FOUNDATIONS, IPMU 2018, PT I, 2018, 853 : 790 - 799
  • [23] MILP modeling and optimization of multi-objective flexible job shop scheduling problem with controllable processing times
    Meng, Leilei
    Zhang, Chaoyong
    Zhang, Biao
    Gao, Kaizhou
    Ren, Yaping
    Sang, Hongyan
    SWARM AND EVOLUTIONARY COMPUTATION, 2023, 82
  • [24] AN APPROXIMATION ALGORITHM FOR THE M-MACHINE PERMUTATION FLOW-SHOP SCHEDULING PROBLEM WITH CONTROLLABLE PROCESSING TIMES
    NOWICKI, E
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 70 (03) : 342 - 349
  • [25] Scheduling job shop problems with sequence-dependent setup times
    Naderi, B.
    Zandieh, M.
    Ghomi, S. M. T. Fatemi
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (21) : 5959 - 5976
  • [26] Preemptive Scheduling on Uniform Parallel Machines with Controllable Job Processing Times
    Natalia V. Shakhlevich
    Vitaly A. Strusevich
    Algorithmica, 2008, 51 : 451 - 473
  • [27] Preemptive scheduling on uniform parallel machines with controllable job processing times
    Shakhlevich, Natalia V.
    Strusevich, Vitaly A.
    ALGORITHMICA, 2008, 51 (04) : 451 - 473
  • [28] Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity
    Wang, Du-Juan
    Yin, Yunqiang
    Liu, Mengqi
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (12) : 3691 - 3705
  • [29] Pre-emptive scheduling problems with controllable processing times
    Shakhlevich, NV
    Strusevich, VA
    JOURNAL OF SCHEDULING, 2005, 8 (03) : 233 - 253
  • [30] Pre-Emptive Scheduling Problems with Controllable Processing Times
    Natalia V. Shakhlevich
    Vitaly A. Strusevich
    Journal of Scheduling, 2005, 8 : 233 - 253
12345