Scheduling Jobs with Release and Delivery Times Subject to Nested Eligibility Constraints

被引：0
|
作者：
Yu-Zhong Zhang
Shu-Guang Li
机构：
[1] Qufu Normal University,Institute of Operations Research
[2] Key Laboratory of Intelligent Information Processing in Universities of Shandong (Shandong Institute of Business and Technology),College of Computer Science and Technology
[3] Shandong Institute of Business and Technology,undefined
来源：
Journal of the Operations Research Society of China | 2021年 / 9卷
关键词：
Scheduling; Nested eligibility constraints; Release time; Delivery time; Polynomial time approximation scheme; 90B35; 68M20;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The problem of scheduling jobs with release and delivery time subject to machine eligibility constraints is considered. The eligible sets of the jobs are nested, and preemptions are not allowed. The goal is to minimize the maximum delivery completion time, i.e., the time by which all jobs are delivered. For the special case of equal release time, a 2-approximation algorithm is presented whose running time depends linearly on the number of jobs. For the general case of unequal release time, a polynomial time approximation scheme is derived.
引用
收藏
页码：63 / 77
页数：14
相关论文
共 50 条
  • [1] Scheduling Jobs with Release and Delivery Times Subject to Nested Eligibility Constraints
    Zhang, Yu-Zhong
    Li, Shu-Guang
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2021, 9 (01) : 63 - 77
  • [2] Scheduling jobs with equal processing times subject to machine eligibility constraints
    Lee, Kangbok
    Leung, Joseph Y. -T.
    Pinedo, Michael L.
    JOURNAL OF SCHEDULING, 2011, 14 (01) : 27 - 38
  • [3] Scheduling jobs with equal processing times subject to machine eligibility constraints
    Kangbok Lee
    Joseph Y.-T. Leung
    Michael L. Pinedo
    Journal of Scheduling, 2011, 14 : 27 - 38
  • [4] A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs
    Mateo, Manuel
    Teghem, Jacques
    Tuyttens, Daniel
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (03) : 1030 - 1053
  • [5] Single machine scheduling with job ready and delivery times subject to resource constraints
    Janiak, Wladyslaw Adam
    Janiak, Adam
    Portmann, Marie-Claude
    2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8, 2008, : 2383 - +
  • [6] Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
    Maecker, Sohnke
    Shen, Liji
    Monch, Lars
    COMPUTERS & OPERATIONS RESEARCH, 2023, 149
  • [7] An algorithm for a bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs
    Mateo, Manuel
    Teghem, Jacques
    Tuyttens, Daniel
    IFAC PAPERSONLINE, 2016, 49 (12): : 1614 - 1619
  • [8] Online scheduling on two uniform machines subject to eligibility constraints
    Lee, Kangbok
    Leung, Joseph Y. -T.
    Pinedoa, Michael L.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (38-40) : 3975 - 3981
  • [9] Scheduling Two Identical Parallel Machines Subjected to Release Times, Delivery Times and Unavailability Constraints
    Al-Shayea, Adel M.
    Saleh, Mustafa
    Alatefi, Moath
    Ghaleb, Mageed
    PROCESSES, 2020, 8 (09)
  • [10] Online scheduling with equal processing times and machine eligibility constraints
    Xu, Jia
    Liu, Zhaohui
    THEORETICAL COMPUTER SCIENCE, 2015, 572 : 58 - 65
12345