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 条
  • [31] A simheuristic approach for the flexible job shop scheduling problem with stochastic processing times
    Caldeira, Rylan H.
    Gnanavelbabu, A.
    SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL, 2021, 97 (03): : 215 - 236
  • [32] Evolving Dispatching Rules for Dynamic Job Shop Scheduling with Uncertain Processing Times
    Karunakaran, Deepak
    Mei, Yi
    Ehen, Gang
    Zhang, Mengjie
    2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 364 - 371
  • [33] Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times
    Jansen, Klaus
    Maack, Marten
    Rau, Malin
    ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (03)
  • [34] Efficient approximation schemes for scheduling problems with release dates and delivery times
    Mastrolilli, M
    JOURNAL OF SCHEDULING, 2003, 6 (06) : 521 - 531
  • [35] Interval job shop scheduling problems
    Deming Lei
    The International Journal of Advanced Manufacturing Technology, 2012, 60 : 291 - 301
  • [36] Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times
    Monaldo Mastrolilli
    Journal of Scheduling, 2003, 6 : 521 - 531
  • [37] Interval job shop scheduling problems
    Lei, Deming
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 60 (1-4): : 291 - 301
  • [38] A review on job shop scheduling with setup times
    Sharma, Pankaj
    Jain, Ajai
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2016, 230 (03) : 517 - 533
  • [39] Optima strategies for multiclass job scheduling on a single machine with controllable processing times
    Aicardi, Michele
    Giglio, Davide
    Minciardi, Riccardo
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2008, 53 (02) : 479 - 495
  • [40] Single machine common due window scheduling with controllable job processing times
    Wan, Guohua
    Combinatorial Optimization and Applications, Proceedings, 2007, 4616 : 279 - 290
12345