Minimizing Maximum Lateness on Unbounded Single Batching Machine with Family Jobs

被引：0
|
作者：
郑睿 [1 ]
李宏余 [2 ]
机构：
[1] Pudong Academy of Reform and Development
[2] School of Management,Fudan University
来源：
Journal of Donghua University(English Edition) | 2010年 / 27卷 / 05期
基金：
中国国家自然科学基金;
关键词：
scheduling; batching machine; family jobs; maximum lateness; dynamic programming;
D O I：
10.19884/j.1672-5220.2010.05.010
中图分类号：
O223 [统筹方法];
学科分类号：
070105 ; 1201 ;
摘要：
The scheduling problem on a single batching machine with family jobs was proposed.The single batching machine can process a group of jobs simultaneously as a batch.Jobs in the same batch complete at the same time.The batch size is assumed to be unbounded.Jobs that belong to different families can not be processed in the same batch.The objective function is minimizing maximum lateness.For the problem with fixed number of m families and n jobs,a polynomial time algorithm based on dynamic programming with time complexity of O(n(n/m+1)m)was presented.
引用
收藏
页码：639 / 642
页数：4
相关论文
共 50 条
  • [41] Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing times and fuzzy due dates
    Chanas, S
    Kasperski, A
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2001, 14 (03) : 377 - 386
  • [42] Minimizing maximum lateness with job families
    Baker, KR
    Magazine, MJ
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 127 (01) : 126 - 139
  • [43] Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
    Jin, F.
    Gupta, J. N. D.
    Song, S.
    Wu, C.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2010, 61 (07) : 1181 - 1189
  • [44] Minimizing maximum tardiness on a single machine with family setup times and machine disruption
    Molaee, Ehsan
    Sadeghian, Ramin
    Fattahi, Parviz
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 129
  • [45] MINIMIZING A QUADRATIC FUNCTION OF JOB LATENESS ON A SINGLE-MACHINE
    GUPTA, SK
    SEN, T
    [J]. ENGINEERING COSTS AND PRODUCTION ECONOMICS, 1983, 7 (03): : 187 - 194
  • [46] A HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE
    Calis, B.
    Bulkan, S.
    Tuncer, F.
    [J]. SOUTH AFRICAN JOURNAL OF INDUSTRIAL ENGINEERING, 2015, 26 (03): : 41 - 53
  • [47] Robust scheduling for minimizing maximum lateness on a serial-batch processing machine
    Wu, Wei
    Tang, Liang
    Pizzuti, Andrea
    [J]. INFORMATION PROCESSING LETTERS, 2024, 186
  • [48] A note on minimizing maximum lateness in a two-machine no-wait flowshop
    Dileepan, P
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (12) : 2111 - 2115
  • [49] Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
    Zambrano-Rey, Gabriel Mauricio
    Gonzalez-Neira, Eliana Maria
    Forero-Ortiz, Gabriel Fernando
    Ocampo-Monsalve, Maria Jose
    Rivera-Torres, Andrea
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024, 338 (01) : 801 - 833
  • [50] Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
    Zambrano-Rey, Gabriel Mauricio
    Gonzalez-Neira, Eliana Maria
    Forero-Ortiz, Gabriel Fernando
    Ocampo-Monsalve, Maria Jose
    Rivera-Torres, Andrea
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024, 338 (01) : 801 - 833
12345