Gyeongsang National University, Jinju, Korea b Department of MIS, Chungbuk National University, Chungbuk, Korea
|
|
- Verity Marsh
- 6 years ago
- Views:
Transcription
1 This article was downloaded by: [Gyeongsang National Uni], [Professor Kwan Hee Han] On: 25 November 2012, At: 20:32 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: Registered office: Mortimer House, Mortimer Street, London W1T 3JH, UK International Journal of Production Research Publication details, including instructions for authors and subscription information: Manufacturing cycle time reduction for batch production in a shared worker environment Kwan Hee Han a, Geon Lee a & Sang Hyun Choi b a Department of Industrial & Systems Engineering, Engineering Research Institute, Gyeongsang National University, Jinju, Korea b Department of MIS, Chungbuk National University, Chungbuk, Korea Version of record first published: 05 Jan To cite this article: Kwan Hee Han, Geon Lee & Sang Hyun Choi (2013): Manufacturing cycle time reduction for batch production in a shared worker environment, International Journal of Production Research, 51:1, 1-8 To link to this article: PLEASE SCROLL DOWN FOR ARTICLE Full terms and conditions of use: This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae, and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand, or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with or arising out of the use of this material.
2 International Journal of Production Research Vol. 51, No. 1, 1 January 2013, 1 8 Manufacturing cycle time reduction for batch production in a shared worker environment Kwan Hee Han a *, Geon Lee a and Sang Hyun Choi b a Department of Industrial & Systems Engineering, Engineering Research Institute, Gyeongsang National University, Jinju, Korea; b Department of MIS, Chungbuk National University, Chungbuk, Korea (Received 22 June 2011; final version received 10 October 2011) Responsive delivery without inefficient excess inventory requires short manufacturing cycle times. The manufacturing cycle time is comprised of operation time, loading/unloading time, set up time and machine idle time. The sum of loading/unloading, set up and machine idle times is called downtime. To shorten batch processing time, reduction in downtime must be the first priority. One way to reduce downtime per work unit is to increase batch quantity, while another is to shorten the sum of set up and machine idle times. Whereas fast cycle time is critical for time-based competition, efficient utilisation of labour is also essential to keep a manufacturing company competitive due to the rapid increase in labour costs. Therefore, in many small and medium-sized businesses, one worker simultaneously handles multiple machines. In such a shared worker environment, machine idle time inevitably occurs due to a lack of available workers. The purpose of this paper is to propose a downtime reduction method based on part sequencing in a shared worker environment. The proposed heuristic results in a significant reduction in average downtime when compared to the results from the existing optimal sequencing method of independent machines. Keywords: set up reduction; part sequencing; shared worker; batch processing 1. Introduction In today s dynamic business environment, the ability to improve performance is a quintessential requirement for business organisations. Manufacturing organisations are thus faced with the need to optimise the way in which they function in order to achieve the best possible performance within necessary constraints. While cost and quality remain critical to the performance goals of businesses, time-based competition strategies have been adopted widely in many industries. Responsive delivery without inefficient excess inventory requires short manufacturing cycle times. In a batch manufacturing environment, batch processing time is the sum of the set up time, loading/unloading time, machine idle time and processing time; that is, T B ¼ T SU þ T ID þ Q i ðt LU þ T O Þ ð1þ where T B ¼ batch processing time, T SU ¼ set up time, T ID ¼ machine idle time, Q i ¼ quantity of i-th batch, T LU ¼ loading/unloading time per work unit, and T O ¼ operation time per work unit. Therefore, the average manufacturing cycle time per work unit (T P ) is expressed as: T P ¼ T B =Q i ¼ ðt SU þ T ID Þ=Q i þ T LU þ T O ð2þ In Equation (2), T P consists of operation time (T O ) and downtime ((T SU þ T ID )/Q i þ T LU ). In other words, T P is the sum of operation cycle time (OCT) and downtime cycle time (DCT). Set up time (T SU ), the main component of DCT, is the time to change tooling, and set up and reprogram the machinery. This is lost production time, which is a disadvantage of batch manufacturing systems. Major reasons for machine idle time (T ID ) include the starvation or blocking of parts and worker unavailability. Loading/unloading time (T LU ) is required for the initialisation and release of machine operation. In Equation (2), T O remains constant for a certain period of time in a normal working environment. Therefore, in order to shorten T P in the above equation, downtime cycle time must be reduced. One way to reduce DCT is to *Corresponding author. hankh@gnu.ac.kr ISSN print/issn X online ß 2013 Taylor & Francis
3 2 K.H. Han et al. increase batch quantity Q i. Since loading/unloading time, dependent as it is on the level of automation of material handling equipment, is varied within a small range, the other way is to shorten the sum of the set up and machine idle times. However, batch quantity is usually determined by due date and priority of orders in a small quantity batch production system, so it is an external variable that is largely outside of a manufacturing company s direct control. Therefore, the latter method is a viable alternative solution for fast manufacturing cycle times. A widely adopted tool these days for the reduction of set up time is the part sequencing method. In addition to the current trend of pursuing speed in manufacturing, efficient use of labour is also important to keep a manufacturing company competitive due to the rapid increase in labour costs. Therefore, in many small and medium-sized businesses, one worker simultaneously operates multiple machines. In such a shared worker environment (SWE), in which the number of workers is smaller than that of the machines operated, idle time inevitably occurs due to worker unavailability when one machine needs a set up or loading/unloading operation while the needed worker sets up or loads/unloads another machine. In contrast to the shared worker environment, idle time due to worker unavailability does not occur in a dedicated worker environment (DWE), in which the number of workers is equal to that of the machines operated. Idle time caused by interruptions between machines operated in an SWE can be put into three categories: (1) a machine needs to be set up while the worker sets up another; (2) a machine needs to be loaded or unloaded while the worker sets up another machine; (3) a machine needs to be loaded or unloaded while the worker loads or unloads another. Whereas there are many approaches to reduce set up times in a dedicated worker environment, there have been no approaches for the reduction of set up and machine idle times in an SWE. Therefore, the purpose of this paper is to propose a heuristic method for the reduction of the total set up and machine idle times based on part sequencing in an SWE. The rest of this paper is organised as follows: Section 2 reviews related works; Section 3 describes incremental approaches for set up and idle time reduction; Section 4 presents experimental results through a case study; and Section 5 summarises the results and suggests directions for future research. 2. Related works In today s current competitive environment, effective sequencing and scheduling has become a necessity for the survival of manufacturing companies in the market place (Pinedo 2008). A considerable amount of research effort has been focused on the area of deterministic scheduling. The static/deterministic scheduling research in which the set up time or cost is of main concern in the problem has been reviewed (Yang 1999). In this survey, the literature is classified into job, class and job-and-class setup situations. Each situation is further classified on the basis of sequence dependence and separability of the setup. The problem of job scheduling with sequence-dependent machine set up times has been the focus of most literature (Allahverdi et al. 1999, Zhu and Wilheim 2006, Allahverdi et al. 2008, Ozkan and Toklu 2010). Pinedo (2008) showed that makespan minimisation on a single machine with sequence-dependent setup time is strongly NPhard. When set up times are dependent on sequence, minimising makespan becomes equivalent to minimising total set up time. This problem corresponds with what is usually called the Travelling Salesman Problem (TSP). Gilmore and Gomory (1964) presented one of the pioneering works on the sequencing-dependent set up time problem which is modelled and solved as a TSP. Due to the NP-hardness of TSPs, the algorithms that will find the shortest sequence of jobs take an unreasonable length of time to execute in a scheduling environment subject to frequent scheduling changes. Therefore, some research has proposed heuristics that can find reasonable solutions quickly (Croes 1958, Lin and Kernighan 1973, Bianco et al. 1988, Tan et al. 2000). Ozgur and Brown (1995) proposed a two-stage travelling salesman heuristic procedure for the problem where similar products produced on the machine can be partitioned into families. Chrisman (1986) developed an optimal sequencing in a gear manufacturing cell as a problem of TSP with rush orders. Efficient grouping procedures, which include machine-specific algorithms for fine-tuning machine operations for a group of PCBs, was proposed to balance the savings in set up time with the increase in assembly time and to minimise the global makespan (Yilmaz et al. 2007). The single machine scheduling problem with independent family (group) set up times where jobs in each family are processed together was proposed to minimise total tardiness using a mixed-integer linear programming (Gupta and Chantaravarapan 2008). An extensive computational investigation concerning the performance evaluation of non-permutation versus permutation schedules for the flow line manufacturing cell with sequence-dependent set up times was presented
4 International Journal of Production Research 3 through the use of an effective simulated annealing algorithm (Ying et al. 2010). A simulation-based approach was adopted for part sequencing in terms of cost minimisation (Rasmussen et al. 1999). And finally, five new set-uporiented rules were proposed that provide better performance than the seven ordinary rules from the literature for scheduling a dynamic job shop using simulation-based experimentation (Vinod and Sridharan 2009). However, an integrated method for the reduction of set up and machine idle times in a shared worker environment has yet to be presented. 3. Incremental approaches for set up and idle time reduction In Equation (2), since T O remains constant and Q i is not a controllable internal variable, the reduction of the sum of T SU, T ID and T LU is necessary for fast manufacturing cycle time. In a dedicated worker environment, since the major solution used to reduce loading/unloading time is automated material handling equipment, a considerable amount of time and money are required for effect, excluding this element from further consideration. Starvation or blocking of parts and machine failure, major reasons for machine idle time, are also excluded because of the complexities involved in finding solutions. In a dedicated worker environment, worker unavailability, the most common cause of machine idle time, does not occur. Therefore, to achieve a fast cycle time, reduction of the set up time is the most controllable internal variable in a DWE. As explained in the first section, one of the major methods used to reduce set up time is part sequencing. The set up time duration of a current batch is dependent on the part characteristics of the previous batch. Therefore, determination of the part sequence is critical in reducing manufacturing cycle time. The part sequencing method can be divided into three types: first is a random selection of the next batch from the process-ready batches; second is selection of the next batch with the shortest set up time when compared to the current batch; and third is the determination of the entire sequence for batches requiring machine processing. In a dedicated worker environment, each machine runs independently from the others. In this situation, the approach for set up time minimisation is reduced to a problem of sequencing a set of N batches on one machine. When all batches have equal release dates, the one-machine scheduling problem is equivalent to the Travelling Salesman problem which is known to be NP-hard. In a TSP, each city corresponds to the time required for set up. Even if TSP is NP-hard, optimal batch sequencing can be obtained through permutation if the number of batches is moderate. Therefore, a two-stage travelling salesman heuristic procedure (Ozgur and Brown 1995) is adopted in this paper where similar products produced on the machine can be partitioned into families. In a shared worker environment, machine idle time occurs due to worker unavailability in addition to set up time. The problem of reducing worker unavailability is very complex because idle time reduction at one machine cannot be achieved without considering other machines loading schedules. This problem becomes more complex when the number of machines operated by one worker increases. Therefore, a heuristic procedure is needed. It is assumed that all batches are available before the start of production. It is also assumed that the total number of batches is partitioned into sub-groups, and each sub-group is assigned to a machine within a workstation according to their part similarity and the workers experience. The proposed heuristic algorithm for the reduction of set up and machine idle times in an SWE is as follows: (1) Of the total part types ready for the start of production, similar parts are partitioned into sub-groups according to their geometry and machining requirements. Each sub-group is allocated to the appropriate machine for processing within a workstation. S is the average number of batches assigned to the sub-group. (2) For each machine in a DWE, all possible batch sequence alternatives for machining can be generated through permutation. The required number of calculations is m (S)!, where m is the number of machines within a workstation. (3) The best P batch sequence alternatives are selected for each machine. All possible batch sequences are generated at each workstation by a combinatorial calculation of m machine s P alternatives. This creates P m alternatives. (4) P m alternatives are evaluated in terms of average downtime cycle time as calculated in Equation (2), and the best combination of each machine s part sequence at a workstation is selected. In the next section, the procedures and effects of the proposed heuristic method are presented in the experimental results.
5 4 K.H. Han et al. 4. Experimental results a case study Company S in this case study produces mainly agricultural and construction machinery parts in Korea. Its production characteristics include high product variety (over 300 different part types) and small production volume. As a result, it has adopted a process-centred machine layout and batch production system which requires time for set up before production. Target Workstation, C, with five identical machines, hobs gear teeth. Two workers operate Workstation C. One worker s role is to set up the machines, while the other worker is responsible for loading/unloading operation of the parts. The reason for the separation of tasks between the workers is the difference in skill level needed for each task: setting up is usually more complicated than loading/unloading. An average of 30 part types are produced in one week. Because of different due dates and rush orders, an average of 90 batches are processed at Workstation C in one week. The average quantity of one batch is 182 pieces (ranging from 99 to 269). Table 1 shows processing cycle time statistics for Workstation C. It is assumed that all batches are ready for production at the start of any specific week. Set up time in a hobbing operation is dependent on three determinants; gear type, gear shape and type of cutting tool used. If one of the determinants of the following batches is equivalent to that of the previous batch, setting up for the next batch is shortened by 20 minutes over the base set up time, which is settled at 60 minutes. Therefore, the set up time range for Workstation C is between 0 and 60 minutes. Part of the set up time matrix is depicted in Figure 1. In Equation (2), the average manufacturing cycle time per work unit consists of two parts: operation cycle time (OCT) and downtime cycle time. OCT usually remains constant for a certain period of time. Downtime operation is not value-added, and makes production cycle time longer. As a result, the average downtime cycle time per work unit (ADCT) is chosen as the criterion for the evaluation of cycle time reduction alternatives. ADCT of a workstation K is calculated as:! ADCT K ¼ XM 1 M X N DCT ij ð3þ N Q i j¼1 where M ¼ number of machines within a workstation, N ¼ number of batches, Q ¼ quantity of i-th batch. Table 1. Processing cycle time statistics (seconds) i¼1 Setup time/batch (sec.) Loading/unloading time/work unit (sec.) Processing time/work unit (sec.) Average time Figure 1. Part of the set up time matrix (seconds).
6 International Journal of Production Research 5 Downtime reduction is achieved through a part sequencing method in this paper. In a DWE (one worker dedicated to one machine), three experiments were conducted. The first method was a random selection of next batches from among the processing-ready batches. The experimental results are shown in Table 2 after 50 runs of calculation. As shown in Table 2, average DCT was seconds, with a wide range from to seconds. The second method is next batch selection with the shortest setup time (SST). This method is divided into two sub-methods according to tie-breaking rules when there are multiple batches with the same SST. The tie-breaking rules adopted were random selection and shortest processing time (SPT). As shown in Table 3, the ADCT of next batch selection methods with SST is and seconds individually. There seems to be no difference between the two sub-methods. Last is the optimal sequencing method, which produces the entire batch sequence of production for each machine as a problem of TSP. However, as described in Section 1, this problem is NP-hard. Therefore, in order to solve this problem within a reasonable time, it is necessary that similar parts are grouped into the same sub-group and allocated in advance to each machine according to their physical characteristics. The experiment for the case study was conducted under the condition that the 90 batches were sub-grouped by their geometric similarities, and assigned to each machine in view of the labour specialisation of the worker(s) and conditions of the machine processing. An average of 18 batches was pre-allocated to every five machines. Moreover, to include rush orders in the experiment, some same-part batches were intentionally allocated to different machines. This problem is solved by an average of 18 factorial computations of all possible part production sequences and a selection of best part sequence for each machine. The number of batches pre-allocated to machines was between 17 and 19. Table 4 shows the best sequence and DCT of each machine with the optimal part sequencing method in DWE. The ADCT of the optimal sequencing method is seconds as summarised in (Table 3). This result reveals a 38.7% reduction over average random selection ( seconds), which is 10.7% shorter than next-batch selection with SST (75.02 seconds). Table 5 shows the part sequence and DCT of the optimal sequence method in an SWE, in which the SWE s ADCT is comparatively longer than that of the DWE because of worker unavailability during setup or loading/ unloading operations. This phenomenon increases machine idle time considerably at Workstation C in the SWE. In an SWE, as shown in Table 5, the optimal sequence of each machine in a DWE does not guarantee the shortest DCT because of a rapid increase in the machine idle time in the SWE. However, it is almost impossible to generate Table 2. Results of random part sequencing. 1a) Best 1b) Average 1c) Worst ADCT (sec.) Table 4. Results of optimal sequencing method in DWE. Solution rank Table 3. Summary of next-batch with SST and optimal sequencing method. Part sequence 2a) Next batch with SST (tiebreaking ¼ random) 2b) Next batch with SST (tiebreaking ¼ SPT) ) Optimal sequencing ADCT (sec.) DCT M/C MC_A MC_B MC_C MC_D MC_E DWE: Optimal sequence of each machine.
7 6 K.H. Han et al. Table 5. Results of optimal sequencing in SWE. Solution rank Part sequence DCT M/C MC_A MC_B MC_C MC_D MC_E SWE: Optimal sequence of each machine. Table 7. Results of proposed heuristic method in SWE. Solution rank Part sequence DCT M/C MC_A MC_B MC_C MC_D MC_E SWE: Proposed Heuristic. Table 6. Size of alternatives and their required CPU times. Number of alternatives CPU time (sec.) ADCT (sec.) an optimal sequencing to minimise the ADCT of Workstation C because of the problem of NP-hardness, which requires (S!) m computations (where S ¼ the average number of batches assigned to one machine, and m ¼ number of machines within a workstation). Therefore, it must be determined which combination of possible part sequence alternatives at each machine produces reasonably good ADCT in Workstation C even though it does not guarantee an optimal solution. In this paper, small subsets of the total possible combinations are investigated for a reasonable, rather than optimal, solution. In other words, the best P sequencing alternatives for each machine in a DWE are selected first. Then, P m alternatives exist for combinatorial calculations (m ¼ 5 in the case study), and the best solution from these alternatives is selected by comparing their ADCT. In this experiment, P is varied from 5 to 20 as shown in Table 6. The software program for the proposed heuristic algorithm ran on a personal computer with a 2.93 GHz Intel core i7 processor and 4 GB RAM. As shown in Table 6, computational CPU time increases exponentially as the number of alternatives increases linearly, whereas ADCT reduction does not occur. This result reveals that a very small number of best part sequences from each machine can generate a reasonably good solution quickly without consuming much CPU time. Table 7 shows the generated best part sequence of each machine and its DCT in an SWE. As shown in Table 7, for machines B, C and E, rank one solution of a DWE is not selected as the best
8 International Journal of Production Research 7 Table 8. Comparison of optimal sequencing with proposed heuristic in SWE. 3) Optimal sequencing 4) Proposed heuristic ADCT (sec.) ADCT (sec) Figure 2. Trends of ADCT and labour utilisation. Labour utilisation(%) sequence in an SWE. In other words, the combination of th best solutions Table 7 generates a shorter ADCT ( seconds) rather than the combination of st best solutions ( seconds in Table 5). Table 8 summarises the results of the optimal part sequencing of each machine and that of the proposed heuristic method in the SWE. As shown in Table 4 and Table 8, the result of optimal part sequencing in the SWE ( seconds) is 247.7% longer than that in the DWE (67.01 seconds), in which the main cause of longer ADCT is a rapid increase of machine idle time due to worker unavailability. In the SWE, the proposed heuristic method resulted in seconds of ADCT, which is 23.5% shorter than that of the optimal sequencing method ( seconds). The disadvantage of a shared worker environment is the increase in ADCT, although an SWE saves on labour costs. In other words, in an SWE there is a trade-off between ADCT and labour utilisation as shown in (Figure 2). As the number of machines operated by two workers decreased in the case study, ADCT also declined in proportion to the decrease in labour utilisation. In other words, when five machines are operated by two workers at Workstation C, ADCT is seconds while labour utilisation is 92.21%. However, if three machines are handled by two operators, this results in a considerable reduction of ADCT (40.6%) whereas labour utilisation is decreased by 34.0%. 5. Conclusions and further research There is no doubt that long-term profit through productivity ranks as the number one goal in manufacturing. However, besides the traditional aim for cost-efficient techniques, additional objectives, such as shorter manufacturing lead time, call for new approaches. To meet the emerging requirements of fast manufacturing cycle time, finding an efficient way to reduce set up and machine idle times in batch production systems is an essential prerequisite for business performance. However, the existing approaches to reducing downtime have been investigated only in a dedicated worker environment where one operator handles only one machine. The proposed heuristic is to reduce set up and machine idle times in a shared worker environment based on the part sequencing method where machine idle time increases due to worker unavailability during set up and loading/ 100% % % % Number of machines operated by two workers
9 8 K.H. Han et al. unloading operations. In this paper, several part sequencing methods for cycle time reduction are evaluated step by step using a real case to find a reasonable solution in an SWE. By using the proposed method, the average downtime cycle time per work unit is reduced significantly over that of the optimal part sequencing for each machine. However, to better support the situation on a real shop floor, a dynamic part sequencing method is needed rather than a deterministic sequencing method. Thus, further research is needed on the development of an interactive real time part sequencer to minimise manufacturing cycle time in a shared worker environment. Acknowledgements This research was financially supported by the Ministry of Education, Science and Technology (MEST) and the National Research Foundation of Korea (NRF) through the Human Resource Training Project for Regional Innovation. Financial support also came from the Ministry of Knowledge Economy (MKE) for the development of a digitally-based real time adaptive manufacturing system platform. References Allahverdi, A., Gupta, J.N.D., and Aldowaisan, T., A review of scheduling research involving setup considerations. Omega the International Journal of Management Science, 27 (2), Allahverdi, A., et al., A survey of scheduling problems with setup times or costs. European Journal of Operations Research, 187 (3), Bianco, L., et al., Scheduling tasks with sequencing dependent processing times. Naval Research Logistics, 35 (2), Chrisman, J.A., Manufacturing cell: analytic setup times and part sequencing. The International Journal of Advanced Manufacturing Technology, 1 (5), Croes, G.A., A method for solving traveling salesman problem. Operations Research, 6 (6), Gilmore, P.C. and Gomory, R.E., Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Operations Research, 12 (5), Gupta, J.N.D. and Chantaravarapan, S., Single machine group scheduling with family setups to minimize total tardiness. International Journal of Production Research, 46 (6), Lin, S. and Kernighan, B.W., An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21 (2), Ozgur, C.O. and Brown, J.R., A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem. Omega the International Journal of Management Science, 23 (2), Ozkan, U. and Toklu, B., Balancing two-sided assembly lines with sequence-dependent setup times. International Journal of Production Research, 48 (18), Pinedo, M., Scheduling: Theory, algorithms, and systems. 3rd ed. New York: Springer. Rasmussen, R.R., Savory, P., and Williams, R.E., Integrating simulation with activity-based management to evaluate manufacturing cell part sequencing. Computers & Industrial Engineering, 37 (4), Tan, K.C., et al., A comparison of four methods for minimizing total tardiness on a single process with sequence dependent setup times. Omega the International Journal of Management Science, 28 (3), Vinod, V. and Sridharan, R., Simulation-based meta-models for scheduling a dynamic job shop with sequence-dependent setup times. International Journal of Production Research, 47 (6), Yang, W.-H., Survey of scheduling research involving setup times. International Journal of Production Research, 30 (2), Yilmaz, I.O., et al., Development of group setup strategies for makespan minimization in PCB assembly. International Journal of Production Research, 45 (4), Ying, K.-C., et al., Permutation and non-permutation schedules for the flow line manufacturing cell with sequence dependent family setups. International Journal of Production Research, 48 (8), Zhu, X. and Wilheim, W.E., Scheduling and lot sizing with sequencing dependent setup: a literature review. IIE transactions, 38 (11),
Hristo Kyuchukov a b a St. Elizabet University, Bratislava, Slovakia
This article was downloaded by: [Hristo Kyuchukov] On: 11 October 2012, At: 22:49 Publisher: Routledge Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
More informationTilburg University. Published in: International Public Management Journal. Document version: Publisher's PDF, also known as Version of record
Tilburg University A Review of: Organization development: Principles, processes, performance by Gary N. McLean. [Review of the book Organization development: Principles, processes, performance, G.N. McLean,
More informationJean Pierre Segers a a Small Business Research Institute, Brussels, To link to this article:
This article was downloaded by: [Jean-Pierre Segers] On: 05 January 2014, At: 14:08 Publisher: Routledge Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
More informationRisk Assessment Techniques
This article was downloaded by: [Stephen N. Luko] On: 27 May 2014, At: 08:21 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
More informationFractionation and Characterization of Waxes A. K. Gupta a ; K. M. Agrawal a ;D. Severin b a
This article was downloaded by: [CSIR ejournals Consortium] On: 25 May 2010 Access details: Access Details: [subscription number 919661628] Publisher Taylor & Francis Informa Ltd Registered in England
More informationPLEASE SCROLL DOWN FOR ARTICLE
This article was downloaded by:[bhattacharya, Baidurya] On: 24 March 2008 Access Details: [subscription number 787846188] Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered
More informationA Variable Capacity Parallel Machine Scheduling Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Variable Capacity Parallel Machine Scheduling Problem Emine Akyol
More informationInternational Journal of Engineering, Business and Enterprise Applications (IJEBEA)
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Engineering, Business and Enterprise
More informationK. Shimakawa a, K. Hayashi a, T. Kameyama a, T. Watanabe a & K. Morigaki b a Department of Electronics and Computer Engineering, Gifu
This article was downloaded by: [University of Cambridge] On: 01 June 2012, At: 05:11 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office:
More informationFlowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion
Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion Ajay Kumar Agarwal Assistant Professor, Mechanical Engineering Department RIMT, Chidana, Sonipat, Haryana,
More informationA Genetic Algorithm for Order Picking in Automated Storage and Retrieval Systems with Multiple Stock Locations
IEMS Vol. 4, No. 2, pp. 36-44, December 25. A Genetic Algorithm for Order Picing in Automated Storage and Retrieval Systems with Multiple Stoc Locations Yaghoub Khojasteh Ghamari Graduate School of Systems
More informationMinimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA
, June 30 - July 2, 2010, London, U.K. Minimizing Makespan for Machine Scheduling and Worker Assignment Problem in Identical Parallel Machine Models Using GA Imran Ali Chaudhry, Sultan Mahmood and Riaz
More informationSCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES
SCHEDULING AND CONTROLLING PRODUCTION ACTIVITIES Al-Naimi Assistant Professor Industrial Engineering Branch Department of Production Engineering and Metallurgy University of Technology Baghdad - Iraq dr.mahmoudalnaimi@uotechnology.edu.iq
More informationFull terms and conditions of use:
This article was downloaded by:[g arcía-c asillas, P. E.] [G arcía-c asillas, P. E.] On: 27 March 2007 Access Details: [subscription number 773569151] Publisher: Taylor & Francis Informa Ltd Registered
More informationLOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS
Advances in Production Engineering & Management 4 (2009) 3, 127-138 ISSN 1854-6250 Scientific paper LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Ahmad, I. * & Al-aney, K.I.M. ** *Department
More informationOptimizing Dynamic Flexible Job Shop Scheduling Problem Based on Genetic Algorithm
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2017 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Optimizing
More informationStochastic Single Machine Family Scheduling To Minimize the Number of Risky Jobs
Stochastic Single Machine Family Scheduling To Minimize the Number of Risky Jobs Gökhan Eğilmez Ͼ, Gürsel A. Süer Industrial and Systems Engineering Department Russ College of Engineering and Technology
More informationSimultaneous Perspective-Based Mixed-Model Assembly Line Balancing Problem
Tamkang Journal of Science and Engineering, Vol. 13, No. 3, pp. 327 336 (2010) 327 Simultaneous Perspective-Based Mixed-Model Assembly Line Balancing Problem Horng-Jinh Chang 1 and Tung-Meng Chang 1,2
More informationFull terms and conditions of use:
This article was downloaded by:[george Mason University] [George Mason University] On: 26 March 2007 Access Details: [subscription number 768492716] Publisher: Taylor & Francis Informa Ltd Registered in
More informationISE480 Sequencing and Scheduling
ISE480 Sequencing and Scheduling INTRODUCTION ISE480 Sequencing and Scheduling 2012 2013 Spring term What is Scheduling About? Planning (deciding what to do) and scheduling (setting an order and time for
More informationTimeDependentLearningEffectandDeteriorationonSingleMachinesScheduling
Global Journal of Researches in Engineering: G Industrial Engineering Volume 14 Issue 4 Version 1.0 Year 2014 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals
More informationWorld Rural Observations 2017;9(3) Developing a New Mathematical Model for Scheduling Trucks in Cross-Docking Systems
Developing a New Mathematical Model for Scheduling Trucks in Cross-Docking Systems Rashed Sahraeian, Mohsen Bashardoost Department of Industrial Engineering, Shahed University, Tehran, Iran Sahraeian@shahed.ac.ir,
More informationMINIMIZING MEAN COMPLETION TIME IN FLOWSHOPS WITH RANDOM PROCESSING TIMES
8 th International Conference of Modeling and Simulation - MOSIM 0 - May 0-, 00 - Hammamet - Tunisia Evaluation and optimization of innovative production systems of goods and services MINIMIZING MEAN COMPLETION
More informationAn Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems
An Effective Genetic Algorithm for Large-Scale Traveling Salesman Problems Son Duy Dao, Kazem Abhary, and Romeo Marian Abstract Traveling salesman problem (TSP) is an important optimization problem in
More informationIntegration of Process Planning and Scheduling Functions for Batch Manufacturing
Integration of Process Planning and Scheduling Functions for Batch Manufacturing A.N. Saravanan, Y.F. Zhang and J.Y.H. Fuh Department of Mechanical & Production Engineering, National University of Singapore,
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 FACILITY LAYOUT DESIGN Layout design is nothing but the systematic arrangement of physical facilities such as production machines, equipments, tools, furniture etc. A plant
More informationGur Mosheiov - Publication List
Gur Mosheiov - Publication List G. Mosheiov. (1992). V-Shaped policies for scheduling deteriorating jobs. Operations Research, Vol. 39, No. 6, pp. 979-991. A. Federgruen and G. Mosheiov. (1993). Simultaneous
More informationHerbert Woratschek a, Chris Horbel b & Bastian Popp a a Department of Services Management, University of Bayreuth,
This article was downloaded by: [Loughborough University], [Mr Andrew Reed] On: 29 December 2014, At: 09:36 Publisher: Routledge Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered
More informationStorage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach
Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Z.X. Wang, Felix T.S. Chan, and S.H. Chung Abstract Storage allocation and yard trucks scheduling
More informationA Tabu Search for the Permutation Flow Shop Problem with Sequence Dependent Setup Times
A Tabu Search for the Permutation Flow Shop Problem with Sequence Dependent Setup Times Nicolau Santos, nicolau.santos@dcc.fc.up.pt Faculdade de Ciências, Universidade do Porto; INESC Porto João Pedro
More informationM. Selim Akturk a a Department of Industrial Engineering, Bilkent University, Bilkent, Ankara, 06800, Turkey Published online: 31 Jan 2011.
This article was downloaded by: [Bilkent University] On: 03 December 2013, At: 17:22 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office:
More informationGeneral-purpose SPWA with the Class-type Skill by Genetic Algorithm
General-purpose SPWA with the Class-type Skill by Genetic Algorithm Daiki Takano Graduate School of Engineering, Maebashi Institute of Technology Email: futsal_ido_me_jp@yahoo.co.jp Kenichi Ida Graduate
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 MANUFACTURING SYSTEM Manufacturing, a branch of industry, is the application of tools and processes for the transformation of raw materials into finished products. The manufacturing
More informationCOMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO
COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO Bathrinath S. 1, Saravanasankar S. 1 and Ponnambalam SG. 2 1 Department of Mechanical Engineering, Kalasalingam
More informationPlacement of effective work-in-progress limits in route-specific unit-based pull systems
This article was downloaded by: [University of Groningen] On: 13 August 2012, At: 02:02 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office:
More informationPerformance Improvement of the Flexible Manufacturing System (FMS) with a Proper Dispatching Rules Planning
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 Performance Improvement of the Flexible Manufacturing System (FMS)
More informationAn Evolutionary Solution to a Multi-objective Scheduling Problem
, June 30 - July 2,, London, U.K. An Evolutionary Solution to a Multi-objective Scheduling Problem Sumeyye Samur, Serol Bulkan Abstract Multi-objective problems have been attractive for most researchers
More informationContents PREFACE 1 INTRODUCTION The Role of Scheduling The Scheduling Function in an Enterprise Outline of the Book 6
Integre Technical Publishing Co., Inc. Pinedo July 9, 2001 4:31 p.m. front page v PREFACE xi 1 INTRODUCTION 1 1.1 The Role of Scheduling 1 1.2 The Scheduling Function in an Enterprise 4 1.3 Outline of
More informationLearning Objectives. Scheduling. Learning Objectives
Scheduling 16 Learning Objectives Explain what scheduling involves and the importance of good scheduling. Discuss scheduling needs in high-volume and intermediate-volume systems. Discuss scheduling needs
More informationA DECISION TOOL FOR ASSEMBLY LINE BREAKDOWN ACTION. Roland Menassa
Proceedings of the 2004 Winter Simulation Conference R.G. Ingalls, M. D. Rossetti, J. S. Smith, and. A. Peters, eds. A DECISION TOOL FOR ASSEMLY LINE REAKDOWN ACTION Frank Shin ala Ram Aman Gupta Xuefeng
More informationMass Customized Large Scale Production System with Learning Curve Consideration
Mass Customized Large Scale Production System with Learning Curve Consideration KuoWei Chen and Richard Lee Storch Industrial & Systems Engineering, University of Washington, Seattle, U.S.A {kwc206,rlstorch}@uw.edu
More informationPusan National University, Busandaehak-ro, Geumjeong-gu, Busan, , Korea
A GENETIC ALGORITHM-BASED HEURISTIC FOR NETWORK DESIGN OF SERVICE CENTERS WITH PICK-UP AND DELIVERY VISITS OF MANDATED VEHICLES IN EXPRESS DELIVERY SERVICE INDUSTRY by Friska Natalia Ferdinand 1, Hae Kyung
More informationA Sequencing Heuristic to Minimize Weighted Flowtime in the Open Shop
A Sequencing Heuristic to Minimize Weighted Flowtime in the Open Shop Eric A. Siy Department of Industrial Engineering email : eric.siy@dlsu.edu.ph Abstract: The open shop is a job shop with no precedence
More informationModelling of Two-sided Assembly Line Balancing Problem with Resource Constraints
IOP Conference Series: Materials Science and Engineering PAPER OPEN ACCESS Modelling of Two-sided Assembly Line Balancing Problem with Resource Constraints Related content - Meta-heuristic algorithm to
More informationParallel Machine Scheduling using Simulation Software
Parallel Machine Scheduling using Simulation Software Jukkrid Jarernram Nara Samattapapong School of Engineering, Industrial Engineering, School of Engineering, Industrial Engineering, Suranaree University
More informationModelling of Two-sided Assembly Line Balancing Problem with Resource Constraints
Home Search Collections Journals About Contact us My IOPscience Modelling of Two-sided Assembly Line Balancing Problem with Resource Constraints This content has been downloaded from IOPscience. Please
More informationEvolutionary Computation for Minimizing Makespan on Identical Machines with Mold Constraints
Evolutionary Computation for Minimizing Makespan on Identical Machines with Mold Constraints Tzung-Pei Hong 1, 2, Pei-Chen Sun 3, and Sheng-Shin Jou 3 1 Department of Computer Science and Information Engineering
More informationHybrid search method for integrated scheduling problem of container-handling systems
Hybrid search method for integrated scheduling problem of container-handling systems Feifei Cui School of Computer Science and Engineering, Southeast University, Nanjing, P. R. China Jatinder N. D. Gupta
More informationGenerational and steady state genetic algorithms for generator maintenance scheduling problems
Generational and steady state genetic algorithms for generator maintenance scheduling problems Item Type Conference paper Authors Dahal, Keshav P.; McDonald, J.R. Citation Dahal, K. P. and McDonald, J.
More informationA Queuing Approach for Energy Supply in Manufacturing Facilities
A Queuing Approach for Energy Supply in Manufacturing Facilities Lucio Zavanella, Ivan Ferretti, Simone Zanoni, and Laura Bettoni Department of Mechanical and Industrial Engineering Università degli Studi
More informationSCHEDULING RULES FOR A SMALL DYNAMIC JOB-SHOP: A SIMULATION APPROACH
ISSN 1726-4529 Int j simul model 9 (2010) 4, 173-183 Original scientific paper SCHEDULING RULES FOR A SMALL DYNAMIC JOB-SHOP: A SIMULATION APPROACH Dileepan, P. & Ahmadi, M. University of Tennessee at
More informationR.O.C. Phone: Fax: b Department of Civil Engineering, National Chiao Tung University, Hsinchu, Taiwan
This article was downloaded by: [National Chiao Tung University 國立交通大學 ] On: 27 April 2014, At: 20:05 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954
More informationInternational Journal of Occupational Safety and Ergonomics
This article was downloaded by: [185.55.64.226] On: 08 March 2015, At: 03:02 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
More informationINTERNATIONAL JOURNAL OF APPLIED ENGINEERING RESEARCH, DINDIGUL Volume 2, No 3, 2011
Minimization of Total Weighted Tardiness and Makespan for SDST Flow Shop Scheduling using Genetic Algorithm Kumar A. 1 *, Dhingra A. K. 1 1Department of Mechanical Engineering, University Institute of
More informationA Decision Support System for Facility Layout Changes
A Decision Support System for Facility Layout Changes KWAN HEE HAN 1, SUNG MOON BAE 2, DONG MING JEONG 3 Department of Industrial & Systems Engineering, Engineering Research Institute, Gyeongsang National
More informationINTEGRATED PROCESS PLANNING AND SCHEDULING WITH SETUP TIME CONSIDERATION BY ANT COLONY OPTIMIZATION
Proceedings of the 1st International Conference on Computers & Industrial Engineering INTEGRATED PROCESS PLANNING AND SCHEDULING WITH SETUP TIME CONSIDERATION BY ANT COLONY OPTIMIZATION S.Y. Wan, T.N.
More informationTo link to this article: PLEASE SCROLL DOWN FOR ARTICLE
This article was downloaded by: [Dr Kenneth Shapiro] On: 08 June 2015, At: 10:16 Publisher: Routledge Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
More informationUniversity Question Paper Two Marks
University Question Paper Two Marks 1. List the application of Operations Research in functional areas of management. Answer: Finance, Budgeting and Investment Marketing Physical distribution Purchasing,
More informationProduction Planning for Parallel Machine Working System using Makespan Determination
Production Planning for Parallel Working System using Makespan Determination D. Aromstian* and S. Homrossukon, Member, IAENG Abstract This work developed the method used to plan the production for parallel
More informationDesigning an Effective Scheduling Scheme Considering Multi-level BOM in Hybrid Job Shop
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Designing an Effective Scheduling Scheme Considering Multi-level BOM
More informationAnalysis and Modelling of Flexible Manufacturing System
Analysis and Modelling of Flexible Manufacturing System Swetapadma Mishra 1, Biswabihari Rath 2, Aravind Tripathy 3 1,2,3Gandhi Institute For Technology,Bhubaneswar, Odisha, India --------------------------------------------------------------------***----------------------------------------------------------------------
More informationCHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING
79 CHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING The present chapter proposes a hybrid intelligent approach (IPSO-AIS) using Improved Particle Swarm Optimization (IPSO) with
More informationICMIEE-PI Minimization of Makespan in Flow Shop Scheduling Using Heuristics
International Conference on Mechanical, Industrial and Energy Engineering 2014 25-26 December, 2014, Khulna, BANGLADESH ICMIEE-PI-14016310 000 Minimization of Makespan in Flow Shop Scheduling Using Heuristics
More informationCapacitated vehicle routing problem for multi-product crossdocking with split deliveries and pickups
Available online at www.sciencedirect.com Procedia - Social and Behavioral Sciences 62 ( 2012 ) 1360 1365 WC-BEM 2012 Capacitated vehicle routing problem for multi-product crossdocking with split deliveries
More information1. For s, a, initialize Q ( s,
Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS
More informationA Review of Canadian EAP Policies Rick Csiernik a a
This article was downloaded by: [Canadian Research Knowledge Network] On: 30 July 2010 Access details: Access Details: [subscription number 783016864] Publisher Routledge Informa Ltd Registered in England
More informationAD Amsterdam, The Netherlands Published online: 15 Jun 2005.
This article was downloaded by: [ECN Energie Onderzoek Centrum Nederland], [Jos Sijm] On: 27 July 2014, At: 23:54 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number:
More informationResearch Article Integrated Production-Distribution Scheduling Problem with Multiple Independent Manufacturers
Mathematical Problems in Engineering Volume 2015, Article ID 579893, 5 pages http://dx.doi.org/10.1155/2015/579893 Research Article Integrated Production-Distribution Scheduling Problem with Multiple Independent
More informationMulti-Period Cell Loading in Cellular Manufacturing Systems
Proceedings of the 202 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 202 Multi-Period Cell Loading in Cellular Manufacturing Systems Gökhan Eğilmez
More informationIMPROVING THE SCHEDULING ALGORITHM OF LIMIS PLANNER
IMPROVING THE SCHEDULING ALGORITHM OF LIMIS PLANNER MASTER THESIS INDUSTRIAL ENGINEERING AND MANAGEMENT Student: First Supervisor : Second Supervisor: Roel Kikkert s0141178 Industrial Engineering and Management
More informationJob Batching and Scheduling for Parallel Non- Identical Machines via MILP and Petri Nets
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Job Batching and Scheduling for Parallel Non- Identical Machines via MILP and
More informationA HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING
A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEUDULING PROF. SARVADE KISHORI D. Computer Science and Engineering,SVERI S College Of Engineering Pandharpur,Pandharpur,India KALSHETTY Y.R. Assistant Professor
More informationA Hybrid Genetic Algorithm for Parallel Machine Scheduling at Semiconductor Back-End Production
Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018) A Hybrid Genetic Algorithm for Parallel Machine Scheduling at Semiconductor Back-End Production J. Adan, 1,2 A.
More informationSingle machine scheduling with two agents for total completion time objectives
Lecture Notes in Management Science (2016) Vol. 8, 106 112 ISSN 2008-0050 (Print), ISSN 1927-0097 (Online) Single machine scheduling with two agents for total completion time objectives Yuvraj Gajpal 1
More informationInternational Research Journal of Engineering and Technology (IRJET) e-issn: Volume: 03 Issue: 12 Dec p-issn:
Enhancing the Performance of Flexible Manufacturing Systems B. Satish Kumar 1, N. Gopikrishna 2 1, 2 Department of Mechanical Engineering, S.R Engineering College, Warangal Telangana, India-506371 ---------------------------------------------------------------------***---------------------------------------------------------------------
More informationPRODUCTION ACTIVITY CONTROL (PAC)
PRODUCTION ACTIVITY CONTROL (PAC) Concerns execution of material plans Contains shop floor control (SFC), and vendor scheduling and follow-up SFC encompasses detailed scheduling and control of individual
More informationAvailable online: 17 Aug 2011
This article was downloaded by: [Gazi University] On: 26 June 2012, At: 00:11 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
More informationSequencing and Scheduling of Jobs and Tools in a Flexible Manufacturing System using Jaya Algorithm
Sequencing and Scheduling of Jobs and Tools in a Flexible Manufacturing System using Jaya Algorithm Modapothula Chaithanya 1, N Siva Rami Reddy 2, P Ravindranatha Reddy, 1 PG Student, Dept of Mechanical,
More informationProcess Design for Efficient Scheduling
Process Design for Efficient Scheduling Evgeny Selensky 1, James Little 1, and J. Christopher Beck 2 1 Cork Constraint Computation Centre University College Cork Cork, Ireland {e.selensky,j.little}@4c.ucc.ie
More informationFull terms and conditions of use:
This article was downloaded by: [Sichuan Normal University], [zou gao lu] On: 05 November 2012, At: 07:16 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954
More informationINTRODUCTION TO FMS. Type of Automation. 1. Fixed automation 2. Programmable automation 3. Flexible automation Fixed Automation
Type of Automation 1. Fixed automation 2. Programmable automation 3. Flexible automation Fixed Automation INTRODUCTION TO FMS Sequence of processing (or assembly) operations is fixed by the equipment configuration
More informationLEAN PRODUCTION FACILITY LAYOUT.
LEAN PRODUCTION FACILITY LAYOUT www.fourprinciples.com BACKGROUND The production facility layout is as important as the technology it houses and has a significant impact on business performance. The layout
More informationIntegration of Process Planning and Job Shop Scheduling Using Genetic Algorithm
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 1 Integration of Process Planning and Job Shop Scheduling Using
More informationCost Oriented Assembly Line Balancing Problem with Sequence Dependent Setup Times
Australian Journal of Basic and Applied Sciences, 5(9): 878-884, 2011 ISSN 1991-8178 Cost Oriented Assembly Line Balancing Problem with Sequence Dependent Setup Times 1 Vahid Yazdanparast, 2 Hamid Hajihosseini,
More informationA Case Study of Capacitated Scheduling
A Case Study of Capacitated Scheduling Rosana Beatriz Baptista Haddad rosana.haddad@cenpra.gov.br; Marcius Fabius Henriques de Carvalho marcius.carvalho@cenpra.gov.br Department of Production Management
More informationXXVI. OPTIMIZATION OF SKUS' LOCATIONS IN WAREHOUSE
XXVI. OPTIMIZATION OF SKUS' LOCATIONS IN WAREHOUSE David Sourek University of Pardubice, Jan Perner Transport Faculty Vaclav Cempirek University of Pardubice, Jan Perner Transport Faculty Abstract Many
More informationPublished online: 05 Jul 2013.
This article was downloaded by: [217.170.245.234] On: 27 June 2014, At: 04:58 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
More informationQuality Engineering Publication details, including instructions for authors and subscription information:
This article was downloaded by: [UVA Universiteitsbibliotheek SZ] On: 17 December 2012, At: 06:09 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered
More informationYokohama, Japan b School of Environmental Sciences, University of East Anglia,
This article was downloaded by: [University of East Anglia Library], [N Keith Tovey] On: 12 March 2013, At: 14:37 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number:
More informationON IMPROVING OPERATIONS SCHEDULING IN ELECTRONICS MANUFACTURING
ON IMPROVING OPERATIONS SCHEDULING IN ELECTRONICS MANUFACTURING Daryl L. Santos, Ph.D. Systems Science and Industrial Engineering Department Small Scale Systems Integration and Packaging (S 3 IP) A NYS
More informationA Hit-Rate Based Dispatching Rule For Semiconductor Manufacturing
International Journal of Industrial Engineering, 15(1), 73-82, 2008. A Hit-Rate Based Dispatching Rule For Semiconductor Manufacturing Muh-Cherng Wu and Ting-Uao Hung Department of Industrial Engineering
More informationA Simulation-based Multi-level Redundancy Allocation for a Multi-level System
International Journal of Performability Engineering Vol., No. 4, July 205, pp. 357-367. RAMS Consultants Printed in India A Simulation-based Multi-level Redundancy Allocation for a Multi-level System YOUNG
More informationWorkload balancing in identical parallel machine scheduling using a mathematical programming method
International Journal of Computational Intelligence Systems, Vol. 7, Supplement 1 (2014), 58-67 Workload balancing in identical parallel machine scheduling using a mathematical programming method Yassine
More informationTHE IMPACT OF THE AVAILABILITY OF RESOURCES, THE ALLOCATION OF BUFFERS AND NUMBER OF WORKERS ON THE EFFECTIVENESS OF AN ASSEMBLY MANUFACTURING SYSTEM
Volume8 Number3 September2017 pp.40 49 DOI: 10.1515/mper-2017-0027 THE IMPACT OF THE AVAILABILITY OF RESOURCES, THE ALLOCATION OF BUFFERS AND NUMBER OF WORKERS ON THE EFFECTIVENESS OF AN ASSEMBLY MANUFACTURING
More informationDeveloping a hybrid algorithm for distribution network design problem
Proceedings of the 2011 International Conference on Industrial Engineering and Operations Management Kuala Lumpur, Malaysia, January 22 24, 2011 Developing a hybrid algorithm for distribution network design
More informationProduct Scheduling in a Multi-Product Colour Processing Facility - Case Study at TN Textiles (Pvt) Ltd
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 Product Scheduling in a Multi-Product Colour Processing Facility -
More informationScheduling a dynamic job shop production system with sequence-dependent setups: An experimental study
Robotics and Computer-Integrated Manufacturing ] (]]]]) ]]] ]]] www.elsevier.com/locate/rcim Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study V. Vinod
More informationProceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds.
Proceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds. SIMULATION-BASED CONTROL FOR GREEN TRANSPORTATION WITH HIGH DELIVERY SERVICE
More informationAndrés Monzón, Floridea Di Ciommo.
This article was downloaded by: 10.3.98.93 On: 18 Dec 2018 Access details: subscription number Publisher: CRC Press Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office:
More informationMODELING LOT ROUTING SOFTWARE THROUGH DISCRETE-EVENT SIMULATION. Chad D. DeJong Thomas Jefferson
Proceedings of the 1999 Winter Simulation Conference P. A. Farrington, H. B. Nembhard, D. T. Sturrock, and G. W. Evans, eds. MODELING LOT ROUTING SOFTWARE THROUGH DISCRETE-EVENT SIMULATION Chad D. DeJong
More information