A Linear Time Exact Algorithm for Scheduling Unit-processing-time-jobs with Sizes 1 or k

被引：0
|
作者：
Xin, Xiao [1 ]
Mu, Guohua [1 ]
Mou, Min [1 ]
机构：
[1] Shandong Inst Business & Technol, Coll Foreign Studies, Yantai 264005, Peoples R China
来源：
PROCEEDINGS OF THE 2017 2ND INTERNATIONAL CONFERENCE ON MATERIALS SCIENCE, MACHINERY AND ENERGY ENGINEERING (MSMEE 2017) | 2017年 / 123卷
关键词：
Scheduling; Batch machines; Job sizes; Makespan; Linear time exact algorithm; MACHINE;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The problem of scheduling jobs with sizes on batch machines is considered. Each machine can process several jobs as a batch simultaneously as long as the total size of these jobs does not exceed the capacity of the machine. The processing time of a batch is defined to be the longest processing time of the jobs in the batch. The goal is to minimize makespan, i.e., the maximum job completion time. It has been known to be strongly NP-hard. A linear time exact algorithm is presented for a special case where all the jobs have processing times 1 and sizes 1 or k (k is not fixed).
引用
收藏
页码：1760 / 1763
页数：4
相关论文
共 50 条
  • [21] Scheduling jobs under increasing linear machine maintenance time
    Xu, Dehua
    Yin, Yunqiang
    Li, Hongxing
    JOURNAL OF SCHEDULING, 2010, 13 (04) : 443 - 449
  • [22] A simple linear time algorithm for scheduling with step-improving processing times
    Ji, Min
    He, Yong
    Cheng, T. C. E.
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (08) : 2396 - 2402
  • [23] Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
    Nhan-Quy Nguyen
    Yalaoui, Farouk
    Amodeo, Lionel
    Chehade, Hicham
    Toggenburger, Pascal
    COMPUTERS & OPERATIONS RESEARCH, 2018, 90 : 110 - 124
  • [24] Controllable Processing Time Scheduling with Total Weighted Completion Time Objective and Deteriorating Jobs
    Wang, Ji-Bo
    Wang, Yi-Chun
    Wan, Congying
    Lv, Dan-Yang
    Zhang, Lei
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2024, 41 (03)
  • [25] Scheduling jobs with position and sum-of-processing-time based processing times
    Lu, Yuan-Yuan
    Wang, Jian-Jun
    Huang, Xue
    APPLIED MATHEMATICAL MODELLING, 2015, 39 (14) : 4013 - 4021
  • [26] ON-LINE SCHEDULING OF UNIT TIME JOBS WITH REJECTION ON UNIFORM MACHINES
    Shoupeng LIU Yuzhong ZHANG Binzhou Medical University
    Journal of Systems Science & Complexity, 2008, (01) : 114 - 118
  • [27] No-idle Parallel Machine Scheduling of Unit-time Jobs
    Brauner, Nadia
    Kovalyov, Mikhail Y.
    Quilliot, Alain
    Toussaint, Helene
    2019 6TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT 2019), 2019, : 807 - 811
  • [28] ON-LINE SCHEDULING OF UNIT TIME JOBS WITH REJECTION ON UNIFORM MACHINES
    Shoupeng LIU Yuzhong ZHANG Binzhou Medical University Yantai China Institute of Operations Research Qufu Normal University Rizhao China
    JournalofSystemsScienceandComplexity, 2008, 21 (01) : 114 - 118
  • [29] On-line scheduling of unit time jobs with rejection on uniform machines
    Liu, Shoupeng
    Zhang, Yuzhong
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2008, 21 (01) : 114 - 118
  • [30] On-Line Scheduling of Unit Time Jobs with Rejection on Uniform Machines
    Shoupeng Liu
    Yuzhong Zhang
    Journal of Systems Science and Complexity, 2008, 21 : 114 - 118
12345