Single machine batch scheduling to minimize total completion time and resource consumption costs

被引：17
|
作者：
Shabtay, Dvir [1 ]
Steiner, George [1 ]
机构：
[1] McMaster Univ, Management Sci & Informat Syst Area, Michael G DeGroote Sch Business, Hamilton, ON, Canada
来源：
JOURNAL OF SCHEDULING | 2007年 / 10卷 / 4-5期
基金：
加拿大自然科学与工程研究理事会;
关键词：
batching; single machine scheduling; resource allocation; optimization;
D O I：
10.1007/s10951-007-0025-9
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper we study the single-machine batch scheduling problem under batch availability, where both setup and job processing times are controllable by allocating a continuously divisible nonrenewable resource. Under batch availability a set of jobs is processed contiguously and completed together, when the processing of the last job in the batch is finished. We present polynomial time algorithms to find the job sequence, the partition of the job sequence into batches and the resource allocation, which minimize the total completion time or the total production cost (inventory plus resource costs).
引用
收藏
页码：255 / 261
页数：7
相关论文
共 50 条
  • [21] Improved Algorithms for Single-Machine Serial-Batch Scheduling With Rejection to Minimize Total Completion Time and Total Rejection Cost
    Yin, Yunqiang
    Cheng, Tai Chiu Edwin
    Wang, Dujuan
    Wu, Chin-Chia
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2016, 46 (11): : 1578 - 1588
  • [22] Scheduling to minimize the maximum total completion time per machine
    Wan, Long
    Ding, Zhihao
    Li, Yunpeng
    Chen, Qianqian
    Tan, Zhiyi
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 242 (01) : 45 - 50
  • [23] The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
    Epstein, Leah
    Levin, Asaf
    OPERATIONS RESEARCH LETTERS, 2016, 44 (06) : 772 - 774
  • [24] An optimal online algorithm for single machine scheduling to minimize total general completion time
    Liu, Ming
    Chu, Chengbin
    Xu, Yinfeng
    Huo, Jiazhen
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 23 (02) : 189 - 195
  • [25] Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time
    Ma, Ran
    Yuan, Jinjiang
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 158 : 114 - 119
  • [26] Scheduling Jobs on a Single Machine With Dirt Cleaning Consideration to Minimize Total Completion Time
    Chen, Yarong
    Su, Ling-Huey
    Tsai, Ya-Chih
    Huang, Shenquan
    Chou, Fuh-Der
    IEEE ACCESS, 2019, 7 : 22290 - 22300
  • [27] An optimal online algorithm for single machine scheduling to minimize total general completion time
    Ming Liu
    Chengbin Chu
    Yinfeng Xu
    Jiazhen Huo
    Journal of Combinatorial Optimization, 2012, 23 : 189 - 195
  • [28] Scheduling multiple orders per job in a single machine to minimize total completion time
    Mason, Scott J.
    Chen, Jen-Shiang
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 207 (01) : 70 - 77
  • [29] Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
    H.A.J. Crauwels
    C.N. Potts
    L.N. Van Wassenhove
    Annals of Operations Research, 1997, 70 : 261 - 279
  • [30] Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
    Crauwels, HAJ
    Potts, CN
    VanWassenhove, LN
    ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) : 261 - 279
12345