Minimizing makespan with multiple-orders-per-job in a two-machine flowshop

被引：11
|
作者：
Laub, Jeffrey D. [1 ]
Fowler, John W. [1 ]
Keha, Ahmet B. [1 ]
机构：
[1] Arizona State Univ, Tempe, AZ 85287 USA
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2007年 / 182卷 / 01期
关键词：
scheduling; flowshop; multiple-orders-per-job; semiconductor manufacturing;
D O I：
10.1016/j.ejor.2006.07.023
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We investigate a new scheduling problem, multiple-orders-per-job (MOJ), in the context of a two-machine flowshop. Lower bounds for the makespan performance measure are provided for combinations of lot-processing and item-processing machines. An optimization model is presented that addresses both job formation and job sequencing. We define a heuristic to minimize the makespan for the MOJ problem for two-machine item-processing flowshops. The heuristic obtains solutions within 2% of a tight lower bound and runs in O(HF) time, where H is the number of orders and F is the restricted number of jobs. (c) 2006 Elsevier B. V. All rights reserved.
引用
收藏
页码：63 / 79
页数：17
相关论文
共 50 条
  • [21] Two-machine flowshop scheduling with a truncated learning function to minimize the makespan
    Cheng, T. C. E.
    Wu, Chin-Chia
    Chen, Juei-Chao
    Wu, Wen-Hsiang
    Cheng, Shuenn-Ren
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) : 79 - 86
  • [22] Minimizing the makespan and flowtime in two-machine stochastic open shops
    Dept. of Business Administration, College of Management, Fu-Jen Catholic University, Taipei, Taiwan
    不详
    Probab. Eng. Inf. Sci., 4 (557-567):
  • [23] Minimizing the makespan and flowtime in two-machine stochastic open shops
    Lee, TS
    Klutke, GA
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 1996, 10 (04) : 557 - 567
  • [24] Scheduling Piecewise Linear Deteriorating Jobs to Minimize Makespan in a Two-Machine Flowshop
    Jafari-Nodoushan A.
    Zare H.K.
    Lotfi M.M.
    Tavakkoli-Moghaddam R.
    Operations Research Forum, 2 (4)
  • [25] Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
    Wang, Ji-Bo
    Ji, P.
    Cheng, T. C. E.
    Wang, Dan
    OPTIMIZATION LETTERS, 2012, 6 (07) : 1393 - 1409
  • [26] Stochastically minimizing the makespan in two-machine flow shops without blocking
    Kamburowski, J
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (02) : 304 - 309
  • [27] Minimizing makespan in the two-machine flow-shop with release times
    Politecnico di Torino, Torino, Italy
    J Oper Res Soc, 1 (77-85):
  • [28] Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
    Ji-Bo Wang
    P. Ji
    T. C. E. Cheng
    Dan Wang
    Optimization Letters, 2012, 6 : 1393 - 1409
  • [29] Minimizing the Total Completion Time in a Two-machine Flowshop with Release Times
    Gong, Hua
    Chen, Daheng
    PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 4136 - 4140
  • [30] Minimizing total completion time in a two-machine flowshop with a learning effect
    Lee, WC
    Wu, CC
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2004, 88 (01) : 85 - 93
12345