Determination of common due window location in a single machine scheduling problem

被引：62
|
作者：
Liman, SD [1 ]
Panwalkar, SS [1 ]
Thongmee, S [1 ]
机构：
[1] LONESTAR CO,PUNE,MAHARASHTRA,INDIA
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1996年 / 93卷 / 01期
关键词：
scheduling theory; production; just-in-time;
D O I：
10.1016/0377-2217(95)00181-6
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the static deterministic single machine scheduling problem in which all jobs have a common due window. Jobs that are completed within the window incur no penalty. The objective is to find the optimal sequence and the optimal common due window location given that the due window size is a problem parameter such that the weighted sum of earliness. tardiness, and due window location penalties is minimized. We propose an O(n log n) algorithm to solve the problem. Me also consider two special cases For which simple solutions can be obtained.
引用
收藏
页码：68 / 74
页数：7
相关论文
共 50 条
  • [1] Common due window size and location determination in a single machine scheduling problem
    Liman, SD
    Panwalkar, SS
    Thongmee, S
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (09) : 1007 - 1010
  • [2] A single machine scheduling problem with common due window and controllable processing times
    Surya D. Liman
    Shrikant S. Panwalkar
    Sansern Thongmee
    [J]. Annals of Operations Research, 1997, 70 : 145 - 154
  • [3] A single machine scheduling problem with common due window and controllable processing times
    Liman, SD
    Panwalkar, SS
    Thongmee, S
    [J]. ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) : 145 - 154
  • [4] Batch scheduling with a common due window on a single machine
    Zhao, Hongluan
    Hu, Fasheng
    Li, Guojun
    [J]. FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2006, 4223 : 641 - 645
  • [5] Single-machine scheduling with a common due window
    Yeung, WK
    Oguz, C
    Cheng, TCE
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (02) : 157 - 175
  • [6] UNBOUNDED BATCH SCHEDULING WITH A COMMON DUE WINDOW ON A SINGLE MACHINE
    Hongluan ZHAO School of Computer Science and TechnologyShandong Jianzhu UniversityJinan China Guojun LI School of Mathematics and System ScienceShandong UniversityJinan China
    Computational Systems and Biology LaboratoryDepartment of Biochemistry and Molecular Biologythe University of GeorgiaAnthens USA
    [J]. JournalofSystemsScienceandComplexity., 2008, 21 (02) - 303
  • [7] UNBOUNDED BATCH SCHEDULING WITH A COMMON DUE WINDOW ON A SINGLE MACHINE
    Hongluan ZHAO School of Computer Science and Technology
    Computational Systems and Biology Laboratory
    [J]. Journal of Systems Science & Complexity, 2008, 21 (02) : 296 - 303
  • [8] Scheduling deteriorating jobs with a common due window on a single machine
    Meng, Jintao
    Yu, Jun
    Lu, Xiaoxu
    [J]. Information Technology Journal, 2012, 11 (03) : 392 - 395
  • [9] Unbounded batch scheduling with a common due window on a single machine*
    Hongluan ZHAO
    Guojun LI
    [J]. Journal of Systems Science and Complexity, 2008, 21
  • [10] Unbounded batch scheduling with a common due window on a single machine
    Zhao, Hongluan
    Li, Guojun
    [J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2008, 21 (02) : 296 - 303
12345