Filters








20,923 Hits in 8.2 sec

A review of scheduling problem and resolution methods in flexible flow shop

Tian-Soon Lee, Ying-Tai Loong
2019 International Journal of Industrial Engineering Computations  
The Flexible flow shop (FFS) is defined as a multi-stage flow shops with multiple parallel machines.  ...  FFS scheduling problem is a complex combinatorial problem which has been intensively studied in many real world industries.  ...  Makespan or completion time minimization can be used in different environmental constraints.  ... 
doi:10.5267/j.ijiec.2018.4.001 fatcat:kiq2jjjsmzgtpoaudrq4qc7ndi

Late work minimization in a small flexible manufacturing system

Malgorzata Sterna
2007 Computers & industrial engineering  
It optimizes production plans within a single shift in order to minimize the late work, i.e. the amount of work executed after a given due date.  ...  The paper concerns a small flexible manufacturing system consisting of three CNC machines: a lathe machine, milling machine and measurement center and a single robot, located at the Poznań University of  ...  Customers are interested in minimizing parts of their orders which are not finished on time.  ... 
doi:10.1016/j.cie.2006.12.004 fatcat:ah7hkzvi7jh4jmhj4vlvxqut3m

Bir Uygulama: Bir Beyaz Eşya Üretim Firmasının Boyahane Bölümünde Paralel Makineler için Sıraya Bağlı Kurulum Sürelerini içeren bir Model

Selin KASIMOĞLU, Gülce DEMİR, Berrak Pınar YAZ, Durdu Hakan UTKU
2020 Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi  
One of the ways of coping with the inventory problems in the mass production lines is to achieve and implement a detailed production schedule.  ...  In this study, a company with a mass production line in the die house station of a white goods sector is in consideration.  ...  weighted completion time minimization Minimize the total weighted completion time Chen et al. [10] Scheduling with renewable speed-up resources.  ... 
doi:10.47495/okufbed.779834 fatcat:77cefnjbzna3zpnrlvrtekiiyi

Production Engineering

1979 Precision engineering  
This paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan. The objective is to minimize the make span of batch-processing machines in a flow shop.  ...  To optimize these, this paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan.  ...  Their objective is to find a sequence that minimizes a weighted sum of total completion time and make span.  ... 
doi:10.1016/0141-6359(79)90121-1 fatcat:dmjjghi52ffujgxgax3knvsuqq

Production Engineering [chapter]

2004 Standard Handbook of Petroleum and Natural Gas Engineering  
This paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan. The objective is to minimize the make span of batch-processing machines in a flow shop.  ...  To optimize these, this paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan.  ...  Their objective is to find a sequence that minimizes a weighted sum of total completion time and make span.  ... 
doi:10.1016/b978-075067785-1/50018-x fatcat:6fxx43ugundgpkbodpfhp3ell4

PRODUCTION ENGINEERING

2009 Journal of the American Society of Naval Engineers  
This paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan. The objective is to minimize the make span of batch-processing machines in a flow shop.  ...  To optimize these, this paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan.  ...  Their objective is to find a sequence that minimizes a weighted sum of total completion time and make span.  ... 
doi:10.1111/j.1559-3584.1941.tb01541.x fatcat:hbqs6xeppbgtznarcju5vxjzei

Production Engineering [chapter]

2016 Standard Handbook of Petroleum and Natural Gas Engineering  
This paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan. The objective is to minimize the make span of batch-processing machines in a flow shop.  ...  To optimize these, this paper model the problem of a flow shop scheduling with the objective of minimizing the makes pan.  ...  Their objective is to find a sequence that minimizes a weighted sum of total completion time and make span.  ... 
doi:10.1016/b978-0-12-383846-9.00006-0 fatcat:jh7ozj633zdenegdiqnw6hsjne

Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm

D SHIAU, S CHENG, Y HUANG
2008 Expert systems with applications  
This study presents an effective hybrid approach based on constructive genetic algorithm (CGA) for PFFS scheduling with the criterion to minimize the total weighted completion time (WCT).  ...  A proportionate flexible flow shop (PFFS) is a machine environment with parallel identical machines at each stage.  ...  A proportionate flexible flow shop (PFFS) is a machine environment with a number of stages in series, with each stage having several identical machines in parallel.  ... 
doi:10.1016/j.eswa.2006.12.002 fatcat:crunfeks5radzkw2d57ikko3o4

A Literature Review of Energy Efficiency and Sustainability in Manufacturing Systems

Paolo Renna, Sergio Materi
2021 Applied Sciences  
A description of the main approaches used in the analyzed papers was discussed.  ...  ., manufacturing system subclasses (single machine, flow shop, job shop, etc.) or the assembly line, the developed energy-saving policies and the implementation of the renewable energy sources in the studied  ...  In the first step, the production schedule was defined in order to minimize the total weighted completion time, whereas the second phase consisted of the energy supply decisions with the objective of minimizing  ... 
doi:10.3390/app11167366 fatcat:utvylqdpdbgdppmdkiqcjyi57y

A hybrid algorithm for unrelated parallel machines scheduling

Mohsen Shafiei Nikabadi, Reihaneh Naderi
2016 International Journal of Industrial Engineering Computations  
Our objective is to minimize makespan (Maximum completion time of all machines), number of tardy jobs, total tardiness and total earliness at the same time which can be more advantageous in real environment  ...  in minimizing the total cost of the weighted function.  ...  Eren (2009) developed a heuristic approach for minimization of the weighted sum of total completion time and total tardiness with a learning effect of setup times and removal times.  ... 
doi:10.5267/j.ijiec.2016.2.004 fatcat:y7uezg4vkrd75cmetwb6jczle4

Scheduling supply chain node with fixed components arrivals and two partially flexible deliveries

S. Carrera, W. Ramdane-Cherif, M.C. Portmann
2010 IFAC Proceedings Volumes  
fixed date and a second optimized tour will be executed at a flexible date corresponding to the end of the schedule with the remaining customer orders.  ...  This operation is performed by a single non renewable resource. Nevertheless most of the presented results could be easily extended to identical parallel machines.  ...  , when the first trucks are leaving the platform. • in order to minimize Cmax, minimizing the idle times seems a good idea, which leads to prefer no delay schedule, nevertheless a job scheduled sooner  ... 
doi:10.3182/20100908-3-pt-3007.00030 fatcat:p2ytutnifbhxfak3wkyxlsn3xu

Dual Techniques for Scheduling on a Machine with Varying Speed [chapter]

Nicole Megow, José Verschae
2013 Lecture Notes in Computer Science  
Our main result is a PTAS for minimizing the total weighted completion time on a machine of varying speed.  ...  solutions in the weight-dimension.  ...  In this case we say that w is idle weight. A weight-schedule immediately defines a non-preemptive time-schedule by ordering the jobs by decreasing completion weights.  ... 
doi:10.1007/978-3-642-39206-1_63 fatcat:f7oa56g67ndmpptylttyvjshsi

Dual Techniques for Scheduling on a Machine with Varying Speed

Nicole Megow, José Verschae
2018 SIAM Journal on Discrete Mathematics  
Our main result is a PTAS for minimizing the total weighted completion time on a machine of varying speed.  ...  solutions in the weight-dimension.  ...  In this case we say that w is idle weight. A weight-schedule immediately defines a non-preemptive time-schedule by ordering the jobs by decreasing completion weights.  ... 
doi:10.1137/16m105589x fatcat:ahjqwcjwi5dorifh6zb3vvu3y4

An Interactive System for Scheduling Jobs in Electronic Assembly

J. Smed, T. Johtela, M. Johnsson, M. Puranen, O. Nevalainen
2000 The International Journal of Advanced Manufacturing Technology  
In flexible manufacturing systems (FMS) the interaction between the production planner and the scheduling system is essential. This is a typical situation in printed circuit board (PCB) assembly.  ...  In addition to system description, we present statistical data of the effect of the system in an actual production environment.  ...  Jouni Lehtinen from Teleste Corporation for his time and cooperation.  ... 
doi:10.1007/s001700050177 fatcat:niskfhfqlvbq3gudsholbcxdyi

Effect of machine flexibility on the performance of FMS subjected to frequent breakdowns

Anoop Verma, Nishikant Mishra, Ritesh Kumar Singh
2011 International Journal of Services Operations and Informatics  
The paper studies the scheduling problem in a Flexible Manufacturing System (FMS) operating under uncertain environment.  ...  A total of 12 cases have been considered for each flexibility level under each dataset. Flexibility level has been used as a variable to analyse the performance of FMS under these cases.  ...  In case of optional machine, jobs are processed on the machine where non-processing time is minimal.  ... 
doi:10.1504/ijsoi.2011.038314 fatcat:yynugt5oxfaennfuva3pc2r6am
« Previous Showing results 1 — 15 out of 20,923 results