Linear Programming Relaxation Algorithm for Scheduling Problem with Controllable Processing Times

被引：1
|
作者：
Zhang, Feng [1 ]
Liu, Lili [1 ]
机构：
[1] Shanghai Second Polytech Univ, Sch Sci, Shanghai 201209, Peoples R China
来源：
2009 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL I | 2009年
关键词：
linear programming; scheduling; controllable processing time; SINGLE-MACHINE;
D O I：
10.1109/CCCM.2009.5268146
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper we provide a linear programming relaxation algorithm for scheduling problem with controllable processing times. This problem is NP-hard even if there are no precedence constraints between the jobs. We prove that the performance ratio of the algorithm is 4.
引用
收藏
页码：82 / 85
页数：4
相关论文
共 50 条
  • [21] A single machine scheduling problem with common due window and controllable processing times
    Surya D. Liman
    Shrikant S. Panwalkar
    Sansern Thongmee
    Annals of Operations Research, 1997, 70 : 145 - 154
  • [22] Two dimension coding algorithm for single machine scheduling with controllable processing times
    Huang Shao-Feng
    Wang Ning
    Chen Qin-Geng
    WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 7376 - 7380
  • [23] Scheduling two agents with controllable processing times
    Wan, Guohua
    Vakati, Sudheer R.
    Leung, Joseph Y. -T.
    Pinedo, Michael
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 205 (03) : 528 - 539
  • [24] An anticipative scheduling approach with controllable processing times
    Gurel, Sinan
    Korpeoglu, Ersin
    Akturk, M. Selim
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (06) : 1002 - 1013
  • [25] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    LAFON Pascal
    Science China(Technological Sciences), 2011, (05) : 1240 - 1248
  • [26] A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
    Tunc, Huseyin
    COMPUTERS & OPERATIONS RESEARCH, 2021, 132
  • [27] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    LAFON Pascal
    Science China(Technological Sciences), 2011, 54 (05) : 1240 - 1248
  • [28] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    Niu GangGang
    Sun ShuDong
    Lafon, Pascal
    Yang HongAn
    SCIENCE CHINA-TECHNOLOGICAL SCIENCES, 2011, 54 (05) : 1240 - 1248
  • [29] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    GangGang Niu
    ShuDong Sun
    Pascal Lafon
    HongAn Yang
    Science China Technological Sciences, 2011, 54 : 1240 - 1248
  • [30] Nash equilibria for the multi-agent project scheduling problem with controllable processing times
    Alessandro Agnetis
    Cyril Briand
    Jean-Charles Billaut
    Přemysl Šůcha
    Journal of Scheduling, 2015, 18 : 15 - 27
12345