AN APPROXIMATION ALGORITHM FOR A SINGLE-MACHINE SCHEDULING PROBLEM WITH RELEASE TIMES, DELIVERY TIMES AND CONTROLLABLE PROCESSING TIMES

被引：6
|
作者：
NOWICKI, E
机构：
[1] Technical University of Wroclaw, Institute of Engineering Cybernetics, 50-372 Wroclaw
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 72卷 / 01期
关键词：
SINGLE-MACHINE SCHEDULING; APPROXIMATION ALGORITHMS; WORST-CASE ANALYSIS;
D O I：
10.1016/0377-2217(94)90331-X
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The paper deals with a single-machine scheduling problem with release times, delivery times and controllable job processing times. It is assumed that the cost of performing a job is a linear function of its processing time, and the total schedule cost to be minimized is the total processing cost plus maximum completion time cost. In consequence, the processing order of jobs and their processing times are decision variables. A (rho + 1/3)-approximation algorithm for the problem is provided, where rho is the worst-case performance bound of a procedure for solving the pure sequencing problem.
引用
收藏
页码：74 / 81
页数：8
相关论文
共 50 条
  • [31] A robust single-machine scheduling problem with scenario-dependent processing times and release dates
    Wu, Chin-Chia
    Chen, Juin-Han
    Lin, Win-Chin
    Zhang, Xingong
    Ren, Tao
    Wu, Zong-Lin
    Chung, Yu-Hsiang
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2025, 16 (01) : 37 - 50
  • [32] SINGLE-MACHINE STOCHASTIC SCHEDULING WITH DEPENDENT PROCESSING TIMES
    GLAZEBROOK, KD
    WHITAKER, LR
    ADVANCES IN APPLIED PROBABILITY, 1992, 24 (03) : 635 - 652
  • [33] Single machine scheduling with resource dependent release times and processing times
    Wang, XL
    Cheng, TCE
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 162 (03) : 727 - 739
  • [34] A single-machine bicriterion scheduling problem with setup times
    Lee, Wen-Chiung
    Wu, Chin-Chia
    JOURNAL OF STATISTICS & MANAGEMENT SYSTEMS, 2005, 8 (03): : 559 - 568
  • [35] A PTAS for single machine scheduling with controllable processing times
    Schuurman, Petra
    Woeginger, Gerhard J.
    Acta Cybernetica, 2002, 15 (03): : 369 - 378
  • [36] Single machine scheduling with discretely controllable processing times
    Chen, ZL
    Lu, Q
    Tang, GC
    OPERATIONS RESEARCH LETTERS, 1997, 21 (02) : 69 - 76
  • [37] Single-machine slack due-window assignment and scheduling with past-sequence-dependent delivery times and controllable job processing times
    Ji, Min
    Yao, Danli
    Ge, Jiaojiao
    Cheng, T. C. E.
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2015, 9 (06) : 794 - 818
  • [38] A single-machine bi-criterion learning scheduling problem with release times
    Lee, Wen-Chiung
    Wu, Chin-Chia
    Liu, Ming-Fang
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (07) : 10295 - 10303
  • [39] A study of the single-machine two-agent scheduling problem with release times
    Wu, Chin-Chia
    Wu, Wen-Hung
    Chen, Juei-Chao
    Yin, Yunqiang
    Wu, Wen-Hsiang
    APPLIED SOFT COMPUTING, 2013, 13 (02) : 998 - 1006
  • [40] A single-machine deteriorating job scheduling problem of minimizing the makespan with release times
    Lee, Wen-Chiung
    Wu, Chin-Chia
    Chung, Yu-Hsiang
    IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 1952 - 1957
12345