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 条
  • [41] New Results on Single-Machine Scheduling with Rejection to Minimize the Total Weighted Completion Time
    Zhang, Liqi
    Yu, Xue
    Lu, Lingfa
    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2024, 49 (01) : 75 - 94
  • [42] Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
    Crauwels, HAJ
    Hariri, AMA
    Potts, CN
    Van Wassenhove, LN
    ANNALS OF OPERATIONS RESEARCH, 1998, 83 (0) : 59 - 76
  • [43] Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
    Yin, Yunqiang
    Ye, Deshi
    Zhang, Guochuan
    INFORMATION SCIENCES, 2014, 274 : 310 - 322
  • [44] Integer Batch Scheduling Problems for a Single-Machine to Minimize Total Actual Flow Time
    Yusriski, Rinto
    Astuti, Budi
    Sukoyo
    Samadhi, T. M. A. Ari
    Halim, Abdul Hakim
    2ND INTERNATIONAL MATERIALS, INDUSTRIAL, AND MANUFACTURING ENGINEERING CONFERENCE, MIMEC2015, 2015, 2 : 118 - 123
  • [45] An FPTAS for Uniform Machine Scheduling to Minimize The Total Completion Time and The Total Rejection Penalty
    Wu, Dan
    Luo, Chengxin
    ADVANCES IN MECHATRONICS AND CONTROL ENGINEERING II, PTS 1-3, 2013, 433-435 : 2339 - 2342
  • [46] Single-machine scheduling with operator non-availability to minimize total weighted completion time
    Wan, Long
    Yuan, Jinjiang
    INFORMATION SCIENCES, 2018, 445 : 1 - 5
  • [47] An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time
    Pan, YP
    OPERATIONS RESEARCH LETTERS, 2003, 31 (06) : 492 - 496
  • [48] SCHEDULING OF A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME SUBJECT TO RELEASE DATES
    BIANCO, L
    RICCIARDELLI, S
    NAVAL RESEARCH LOGISTICS, 1982, 29 (01) : 151 - 167
  • [49] Single Machine Scheduling Problem With a Weight-Modifying-Activity to Minimize the Total Weighted Completion Time
    Chen, Yarong
    Guan, Zailin
    Tsai, Ya-Chih
    Chou, Fuh-Der
    IEEE Access, 2022, 10 : 45444 - 45456
  • [50] Single Machine Scheduling Problem With a Weight-Modifying-Activity to Minimize the Total Weighted Completion Time
    Chen, Yarong
    Guan, Zailin
    Tsai, Ya-Chih
    Chou, Fuh-Der
    IEEE ACCESS, 2022, 10 : 45444 - 45456
12345