Benefits of lot splitting in job-shop scheduling

被引:37
|
作者
Low, C
Hsu, CM
Huang, KI
机构
[1] Da Yeh Univ, Dept Ind Engn, Da Tsuen 515, Chang Hua, Taiwan
[2] Minghsin Univ Sci & Technol, Dept Business Adm, Hsinchu, Taiwan
关键词
lot splitting; lot streaming; makespan;
D O I
10.1007/s00170-003-1785-9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As the lot-streaming concept has been used widely to reduce the makespan in a production system, most research has investigated the flow shop production systems; however, job-shop production systems have received much less attention, relatively. This study more thoroughly investigates the application of lot splitting in a job shop production system with setup times, which cannot be omitted. The objective investigated not only minimises the makespan but also minimises the total production cost, which includes the material handling cost, the setup cost and the inventory cost. A disjunctive graph is first used to describe the addressed scheduling problem, and an integer programming model is then constructed to obtain an optimal solution. In order to investigate the influence of the number of sublots and sublot sizes on a job-shop production system with regard to the corresponding objective considered, some experiments are conducted and results presented as well.
引用
收藏
页码:773 / 780
页数:8
相关论文
共 50 条
  • [41] Practical JOB-SHOP production scheduling algorithm
    Li, Hao-Lin
    [J]. Shanghai Ligong Daxue Xuebao/Journal of University of Shanghai for Science and Technology, 2002, 24 (04):
  • [42] Job-shop production scheduling with reverse flows
    Abdeljaouad, Med Amine
    Omrane, Anissa
    Bahroun, Zied
    Fondrevelle, Julien
    [J]. 2013 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2013, : 829 - 834
  • [43] A genetic algorithm for flexible job-shop scheduling
    Chen, HX
    Ihlow, J
    Lehmann, C
    [J]. ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, 1999, : 1120 - 1125
  • [44] Genetic algorithms for a job-shop scheduling problem
    Nakagami, M
    Ishida, M
    [J]. KAGAKU KOGAKU RONBUNSHU, 1997, 23 (02) : 175 - 180
  • [45] Resource constraints for preemptive job-shop scheduling
    Pape C.L.E.
    Baptiste P.
    [J]. Constraints, 1998, 3 (4) : 263 - 287
  • [46] Fuzzy job-shop scheduling problems: A review
    Abdullah, Salwani
    Abdolrazzagh-Nezhad, Majid
    [J]. INFORMATION SCIENCES, 2014, 278 : 380 - 407
  • [47] Job-shop production scheduling with reverse flows
    Abdeljaouad, Mohamed Amine
    Bahroun, Zied
    Omrane, Anissa
    Fondrevelle, Julien
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (01) : 117 - 128
  • [48] Flexible Job-Shop Scheduling with Changeover Priorities
    Milne, Holden
    Adesina, Opeyemi
    Campbell, Russell
    Friesen, Barbara
    Khawaja, Masud
    [J]. MACHINE LEARNING, OPTIMIZATION, AND DATA SCIENCE (LOD 2021), PT I, 2022, 13163 : 611 - 625
  • [49] Hybird algorithm for job-shop scheduling problem
    Chen, X
    Kong, QS
    Wu, QD
    [J]. PROCEEDINGS OF THE 4TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-4, 2002, : 1739 - 1743
  • [50] Genetic algorithm for flexible job-shop scheduling
    Univ of Magdeburg, Magdeburg, Germany
    [J]. Proc IEEE Int Conf Rob Autom, (1120-1125):