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 条
  • [41] A BICRITERION APPROACH TO PREEMPTIVE SCHEDULING OF PARALLEL MACHINES WITH CONTROLLABLE JOB PROCESSING TIMES
    NOWICKI, E
    ZDRZALKA, S
    DISCRETE APPLIED MATHEMATICS, 1995, 63 (03) : 237 - 256
  • [42] GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS BASED ON 2 REPRESENTATIONAL SCHEMES
    PARK, LJ
    PARK, CH
    ELECTRONICS LETTERS, 1995, 31 (23) : 2051 - 2053
  • [43] A survey of scheduling with controllable processing times
    Shabtay, Dvir
    Steiner, George
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (13) : 1643 - 1666
  • [44] An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times
    Lu, Chao
    Li, Xinyu
    Gao, Liang
    Liao, Wei
    Yi, Jin
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 104 : 156 - 174
  • [45] Scheduling batches with simultaneous job processing for two-machine shop problems
    Potts, CN
    Strusevich, VA
    Tautenhahn, T
    JOURNAL OF SCHEDULING, 2001, 4 (01) : 25 - 51
  • [46] Flexible job-shop scheduling problem with the number of workers dependent processing times
    Tutumlu, Busra
    Sarac, Tugba
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2025, 16 (02) : 357 - 370
  • [47] An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times
    Zhang, Rui
    Wu, Cheng
    ENTROPY, 2011, 13 (09) : 1708 - 1729
  • [48] New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem
    Gao, Jinsheng
    Zhu, Xiaomin
    Bai, Kaiyuan
    Zhang, Runtong
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2022, 60 (07) : 2254 - 2274
  • [49] AN APPROXIMATION ALGORITHM FOR A SINGLE-MACHINE SCHEDULING PROBLEM WITH RELEASE TIMES, DELIVERY TIMES AND CONTROLLABLE PROCESSING TIMES
    NOWICKI, E
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (01) : 74 - 81
  • [50] Mathematical Models of Flow Shop and Job Shop Scheduling Problems
    Seda, Milos
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 25, 2007, 25 : 122 - 127
12345