Minmax due-date assignment on a two-machine flowshop

被引：0
作者：
Baruch Mor
Gur Mosheiov
机构：
[1] Ariel University,Department of Economics and Business Administration
[2] The Hebrew University,School of Business Administration
来源：
Annals of Operations Research | 2021年 / 305卷
关键词：
Scheduling; Two-machine flowshop; Due-date assignment; Minmax;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We extend two classical scheduling and due-date assignment models. In the first (known in the literature as DIF), due-dates are determined by penalties for exceeding pre-specified deadlines. In the second (known as SLK), due-dates are assigned to jobs as a (linear) function of their processing times. We focus on the minmax versions of these models, and extend the single machine versions to a two-machine flowshop. We further extend the settings to that of a due-window. All the problems studied in this note are shown to have polynomial time solutions.
引用
收藏
页码：191 / 209
页数：18
相关论文
共 48 条
[1]  
Adamopoulos GI(1996)Single machine scheduling with flow allowances Journal of the Operational Research Society 47 1280-1285
[2]  
Pappis CP(2004)A note on a due-date assignment on a two-machine flow-shop Computers & Operations Research 31 473-480
[3]  
Birman M(1987)Minimizing the maximum deviation of job completion time about a common due-date Comp. and Math. with Applications 14 279-283
[4]  
Mosheiov G(2017)Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection Computers & Operations Research 83 150-156
[5]  
Cheng TCE(2013)Minmax due-date assignment with a time-window for acceptable lead-times Annals of Operations Research 211 167-177
[6]  
Gerstl E(2002)A survey of the state-of-the-art of common due date assignment and scheduling research European Journal of Operational Research 139 1-25
[7]  
Mor B(2015)A survey on scheduling problems with due windows European Journal of Operational Research 242 347-357
[8]  
Mosheiov G(1954)Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 61-68
[9]  
Gerstl E(2012)Minmax scheduling problems with common flow-allowance Journal of the Operational Research Society 63 1284-1293
[10]  
Mosheiov G(2012)Scheduling a maintenance activity and due-window assignment based on common flow allowance International Journal of Production Economics 135 222-230
12345