Scheduling of Flowshop Type Production with Dannenbring Method to Obtain Optimal Results with Observing Waiting Time and Weight of Jobs

Linear programming is a step or process to get maximum results with existing resources or it can be said the process of looking for optimal value. One part of scheduling is production scheduling. production scheduling is the use of resources that are few but make the most profit. This paper discusses production scheduling using flowshop type production scheduling by taking into account transportation times and work weights. This paper uses the Dannenbring method with the aim of finding the optimal sequence of problems by considering the total production time (makespan) and the average Weigted Mean Flow Time (WMFT). Based on the results of the Dannenbring method, the results of flowshop scheduling are obtained with a total makespan of 75 hours and the WMFT value is 28, 87 hours.

[1]  Yang-Kuei Lin,et al.  Unrelated parallel machine scheduling with setup times and ready times , 2014 .

[2]  Amritpal Singh Raheja,et al.  Reactive repair tool for job shop schedules , 2005 .

[3]  Tarek Y. ElMekkawy,et al.  A generic deadlock-free reactive scheduling approach , 2009 .

[4]  S.M.T. Fatemi Ghomi,et al.  Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates , 2014 .

[5]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

[6]  Machfud Machfud,et al.  Model Penunjang Keputusan Jadwal Produksi Jus Buah Segar , 2012 .

[7]  Socorro Rangel,et al.  A survey of case studies in production scheduling: Analysis and perspectives , 2017, J. Comput. Sci..

[8]  Md. Sanowar Hossain,et al.  ICMIEE-PI-14016310 000 Minimization of Makespan in Flow Shop Scheduling Using Heuristics , 2014 .

[9]  Hannu Ahonen,et al.  Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: formulation and solution procedures , 2017 .

[10]  Imma Ribas,et al.  Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization , 2015, Comput. Ind. Eng..

[11]  Vladimir Modrak,et al.  A Comparison of Constructive Heuristics with the Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem , 2012 .

[12]  Jing Li,et al.  Hybrid flow shop rescheduling algorithm for perishable products subject to a due date with random invalidity to the operational unit , 2017 .

[13]  Mehmet Mutlu Yenisey,et al.  Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends , 2014 .

[14]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[15]  Javad Seif.  The Integration of Maintenance Decisions and Flow Shop Scheduling , 2018 .

[16]  Sultan Mahmood,et al.  No-wait Flowshop Scheduling Using Genetic Algorithm , 2012 .

[17]  Seyed Jafar Sadjadi,et al.  The General Flowshop Scheduling Problem: Mathematical Models , 2008 .

[18]  Qazi Shoeb Ahmad.  Constrained Flow-Shop Scheduling Problem with m Machines , 2015 .

[19]  M AnthonyXavior,et al.  A Genetic Algorithm Applied Heuristic to Minimize the Makespan in a Flow Shop , 2014 .

[20]  Mariano Frutos,et al.  The Non-Permutation Flow-Shop scheduling problem: A literature review , 2017, Omega.

[21]  Ping Chen,et al.  An improved NEH-based heuristic for the permutation flowshop problem , 2008, Comput. Oper. Res..

[22]  Zied Bahroun,et al.  Job-shop production scheduling with reverse flows , 2013, 2013 International Conference on Control, Decision and Information Technologies (CoDIT).

[23]  P. Rajendran,et al.  Solving Constrained Flow-Shop Scheduling Problems with Three Machines , 2010 .

[24]  Wei Li,et al.  An Efficient Constructive Heuristic to Balance Trade-Offs Between Makespan and Flowtime in Permutation Flow Shop Scheduling , 2018 .

[25]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[26]  Tarek Y. ElMekkawy,et al.  Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm , 2011 .

[27]  Deepak Gupta,et al.  CONSTRAINED N-JOB, 3-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH TRANSPORTATION TIME , 2012 .

[28]  Sanja Petrovic,et al.  An investigation into minimising total energy consumption and total weighted tardiness in job shops , 2014 .

[29]  Donya Rahmani,et al.  Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times , 2014 .

[30]  Chung-Cheng Lu,et al.  Minimizing total flow time in permutation flowshop environment , 2012 .

[31]  Tian-Soon Lee,et al.  A review of scheduling problem and resolution methods in flexible flow shop , 2019, International Journal of Industrial Engineering Computations.

[32]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[33]  Ali Allahverdi,et al.  The third comprehensive survey on scheduling problems with setup times/costs , 2015, Eur. J. Oper. Res..

[34]  Xingsheng Gu,et al.  An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems , 2015, Neurocomputing.

[35]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[36]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[37]  Long Wan,et al.  Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines , 2014, Theor. Comput. Sci..

[38]  Ali Allahverdi,et al.  Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan , 2015 .