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 条

[1] Minimizing maximum lateness on unbounded single batching machine with family jobs
Zheng, Rui
Li, Hong-Yu
[J]. Journal of Donghua University (English Edition), 2010, 27 (05) : 639 - 642
[2] Minimizing Weighted Number of Tardy Jobs on Unbounded Single Batching Machine with Family Jobs
Zheng, Rui
Li, Hongyu
[J]. 2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2009, : 1718 - 1722
[3] Minimizing maximum promptness and maximum lateness on a single machine
Hoogeveen, JA
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1996, 21 (01) : 100 - 114
[4] Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
Lazarev, Alexander A.
Arkhipov, Dmitry I.
Werner, Frank
[J]. OPTIMIZATION LETTERS, 2017, 11 (01) : 165 - 177
[5] Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
Alexander A. Lazarev
Dmitry I. Arkhipov
Frank Werner
[J]. Optimization Letters, 2017, 11 : 165 - 177
[6] Scheduling an unbounded batching machine with family jobs and setup times
Zheng, R.
Li, H.
Zhang, X.
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2012, 63 (02) : 160 - 167
[7] Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
Vakhania, Nodari
Werner, Frank
[J]. THEORETICAL COMPUTER SCIENCE, 2013, 501 : 72 - 81
[8] SCHEDULING SEMICONDUCTOR TEST OPERATIONS - MINIMIZING MAXIMUM LATENESS AND NUMBER OF TARDY JOBS ON A SINGLE-MACHINE
UZSOY, R
LEE, CY
MARTINVEGA, LA
[J]. NAVAL RESEARCH LOGISTICS, 1992, 39 (03) : 369 - 388
[9] Metric Interpolation for the Problem of Minimizing the Maximum Lateness for a Single Machine
Lazarev, A. A.
Lemtyuzhnikova, D., V
Tyunyatkin, A. A.
[J]. AUTOMATION AND REMOTE CONTROL, 2021, 82 (10) : 1706 - 1719
[10] Metric Interpolation for the Problem of Minimizing the Maximum Lateness for a Single Machine
A. A. Lazarev
D. V. Lemtyuzhnikova
A. A. Tyunyatkin
[J]. Automation and Remote Control, 2021, 82 : 1706 - 1719

← 1 2 3 4 5 →