Search results

1 – 7 of 7
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 8 March 2013

Pedro L. González‐R, Jose M. Framinan and Rafael Ruiz‐Usano

The aim of this article is to propose a methodology for the design and operation of a just‐in‐time coordination mechanism to control the flow of materials in the supply chain.

1902

Abstract

Purpose

The aim of this article is to propose a methodology for the design and operation of a just‐in‐time coordination mechanism to control the flow of materials in the supply chain.

Design/methodology/approach

A literature review of the problem is presented and a new supply chain coordination mechanism is then proposed.

Findings

The paper reveals that the one aspect not deeply studied yet in the supply chain management is their short‐term control. A simple kanban coordination mechanism demonstrates that is practical in the flow coordination of materials among the different nodes (companies) in a supply chain.

Practical implications

This paper shows recent approaches in the supply chain context, useful to companies looking forward new opportunities in coordination systems for the supply chain.

Originality/value

The paper begins with a review of previous research in the material flow control in the supply chain. The authors then propose a new mechanism and an optimization methodology to deal with the coordination mechanism.

Details

Journal of Manufacturing Technology Management, vol. 24 no. 3
Type: Research Article
ISSN: 1741-038X

Keywords

Access Restricted. View access options
Article
Publication date: 25 January 2022

Seyed Mohammad Hassan Hosseini

This paper aims to address a distributed assembly permutation flow-shop scheduling problem (DAPFSP) considering budget constraints and factory eligibility. The first stage of the…

204

Abstract

Purpose

This paper aims to address a distributed assembly permutation flow-shop scheduling problem (DAPFSP) considering budget constraints and factory eligibility. The first stage of the considered production system is composed of several non-identical factories with different technology levels and so the factories' performance is different in terms of processing time and cost. The second stage is an assembly stage wherein there are some parallel work stations to assemble the ready parts into the products. The objective function is to minimize the maximum completion time of products (makespan).

Design/methodology/approach

First, the problem is formulated as mixed-integer linear programing (MIP) model. In view of the nondeterministic polynomial (NP)-hard nature, three approximate algorithms are adopted based on variable neighborhood search (VNS) and the Johnsons' rule to solve the problem on the practical scales. The proposed algorithms are applied to solve some test instances in different sizes.

Findings

Comparison result to mathematical model validates the performance accuracy and efficiency of three proposed methods. In addition, the result demonstrated that the proposed two-level self-adaptive variable neighborhood search (TLSAVNS) algorithm outperforms the other two proposed methods. Moreover, the proposed model highlighted the effects of budget constraints and factory eligibility on the makespan. Supplementary analysis was presented by adjusting different amounts of the budget for controlling the makespan and total expected costs. The proposed solution approach can provide proper alternatives for managers to make a trade-off in different various situations.

Originality/value

The problem of distributed assembly permutation flow-shop scheduling is traditionally studied considering identical factories. However, processing factories as an important element in the supply chain use different technology levels in the real world. The current paper is the first study that investigates that problem under non-identical factories condition. In addition, the impact of different technology levels is investigated in terms of operational costs, quality levels and processing times.

Details

Kybernetes, vol. 52 no. 6
Type: Research Article
ISSN: 0368-492X

Keywords

Access Restricted. View access options
Article
Publication date: 26 July 2013

Asawin Wongwiwat, Erik L.J. Bohez and Roongrat Pisuchpen

The purpose of this paper is to propose a new generic hybrid Petri Net (PN) model combined with the lowest makespan cut (LMC) for job shop scheduling problems in mold…

426

Abstract

Purpose

The purpose of this paper is to propose a new generic hybrid Petri Net (PN) model combined with the lowest makespan cut (LMC) for job shop scheduling problems in mold manufacturing to minimize the makespan of the mold part manufacture schedule.

Design/methodology/approach

The LMC algorithm finds a solution close to the optimal solution. The searching of the LMC algorithm starts from the lowest estimated makespan (lowest makespan). Almost all of the lowest makespans (LM) are infeasible makespans. A shifting percentage (SP) is added to the LM to obtain the shifting makespan (SM). The SM is compared with the completion time computed from the reachability tree of the Petri Net (PN) model. If the completion time is greater than the SM, the corresponding branch is cut from the reachability graph, and the SM will be compared with another branch from the reachability tree. There are two scenarios. In the first scenario, there is no feasible solution resulting from the comparison of the completion time and the SM, because the SM is lower than all of the feasible solutions. Therefore, the SP is used to increase the SM. On the contrary, in the second scenario, there is a feasible solution: the SP is used to reduce the SM. In the first scenario, a makespan that is lower than the optimal makespan is found. In the second scenario, a makespan that is greater than the optimal makespan is found. After getting close to bounds of the optimal makespan, the least makespan found in the bounds is the best solution.

Findings

The integration of the Petri Net (PN) model and the LMC algorithm can help to improve the production efficiency. In a case study, the proposed algorithm is being compared with other heuristical methods which are practical examples of mold makespans based on the shortest and the longest processing times. The schedule or the sequence obtained by the proposed algorithm is 30% less than the other methods.

Research limitations/implications

This research will consider scheduling multiple mold. The mold design and the mold testing phase are not considered.

Practical implications

The time to produce a mold is very important. Reducing the mold production time will provide more time for mold assembly and testing. The aim of LMC algorithm is minimize the makespan. The time to produce a mold is reduced by finding the best sequence of the jobs and machines.

Originality/value

This paper proposes the new generic hybrid Petri Net model combined with LMC for job shop scheduling problem in the case of mold making shop to optimize the makespan of mold parts scheduling.

Details

Assembly Automation, vol. 33 no. 3
Type: Research Article
ISSN: 0144-5154

Keywords

Access Restricted. View access options
Article
Publication date: 28 November 2019

Marc Morenza-Cinos, Victor Casamayor-Pujol and Rafael Pous

The combination of the latest advancements in information and communication technologies with the latest developments in AutoID technologies, especially radio frequency…

2027

Abstract

Purpose

The combination of the latest advancements in information and communication technologies with the latest developments in AutoID technologies, especially radio frequency identification (RFID), brings the possibility of high-resolution, item-level visibility of the entire supply chain. In the particular case of retail, visibility of both the stock count and item location in the shop floor is crucial not only for an effective management of the retail supply chain but also for physical retail stores to compete with online retailers. The purpose of this paper is to propose an autonomous robot that can perform stock-taking using RFID for item-level identification much more accurately and efficiently than the traditional method of using human operators with RFID handheld readers.

Design/methodology/approach

This work follows the design science research methodology. The paper highlights a required improvement for an RFID inventory robot. The design hypothesis leads to a novel algorithm. Then the cycle of development and evaluation is iterated several times. Finally, conclusions are derived and a new basis for further development is provided.

Findings

An autonomous robot for stock-taking is proven feasible. By applying a proper navigation strategy, coupled to the stream of identifications, the accuracy, precision, consistency and time to complete stock-taking are significantly better than doing the same task manually.

Research limitations/implications

The main limitation of this work is the unavailability of data to analyze the actual impact on the correction of inventory record inaccuracy and its subsequent implications for the supply chain management. Nonetheless, it is shown that figures of actual stock-tacking procedures can be significantly improved.

Originality/value

This paper discloses the potential of deploying an inventory robot in the supply chain. The robot is called to be a key source of inventory data conforming supply chain management 4.0 and omnichannel retail.

Details

International Journal of Physical Distribution & Logistics Management, vol. 49 no. 10
Type: Research Article
ISSN: 0960-0035

Keywords

Access Restricted. View access options
Article
Publication date: 21 May 2020

Kaliyan Mathiyazhagan, Sonu Rajak, Swayam Sampurna Panigrahi, Vernika Agarwal and Deepa Manani

In a quest to meet increasing pressure to incorporate environmental and sustainability factors due to the legislations and growing public awareness, companies are rethinking of…

2412

Abstract

Purpose

In a quest to meet increasing pressure to incorporate environmental and sustainability factors due to the legislations and growing public awareness, companies are rethinking of strategizing their supply chain network to take control of the reverse flow of products as well. This growing interest has also led to tremendous growth in publications occurring in several reputed journals in the last few years. In this context, the purpose of this article is to perform a systematic literature survey of recent and state-of-the-art papers in order to draw insights and highlight the future directions.

Design/methodology/approach

This paper has selected and reviewed 204 papers published from the year 2002–2017. The papers were collected from the web of science and Google scholar database which have the DOI number. The selected papers were then categorized into main five core areas of RSC management namely reverse supply chain (RSC), Reverse Logistics (RL), Remanufacturing, Closed-Loop Supply Chain (CLSC) and Product Recovery Systems (PRS) and then analyzed with great detail. Finally, the research gaps that were identified from the study have been highlighted for future research opportunities.

Findings

This paper would serve as a roadmap to the managers who wish to align their forward and reverse supply chains for overall growth and development. It provides an in-depth knowledge on RSC to the researchers working in this domain. The scholars would be able to identify the areas of RSC which have been already addressed and the areas which remain unaddressed.

Originality/value

This paper presents a systematic literature survey of state-of-the-art papers that was published in the reputed journal in the area of RSC. Total 204 numbers of papers which were published in the reputed journals between 2002 and 2017 are reviewed, categorized and analysed to draw the opportunities and future research direction in the area of RSC.

Details

International Journal of Productivity and Performance Management, vol. 70 no. 4
Type: Research Article
ISSN: 1741-0401

Keywords

Access Restricted. View access options
Article
Publication date: 4 December 2019

Jürgen Strohhecker and Andreas Größler

The purpose of this paper is to investigate the effects of extended production disruptions because of process quality breakdowns on operational and financial performance. The…

394

Abstract

Purpose

The purpose of this paper is to investigate the effects of extended production disruptions because of process quality breakdowns on operational and financial performance. The investigation is conducted over the market cycle of a highly profitable product, e.g. a patented pharmaceutical. In particular, the study evaluates performance effects of different inventory level policies. The paper considers different degrees of availability of a substitute product.

Design/methodology/approach

The study uses simulation experiments based on system dynamics methodology to derive inventory policies on handling infrequently happening but severe production process breakdowns. The simulation model is inspired by empirical case study research and is based on standard modeling formulations from the literature.

Findings

The scenario analyses show that the optimal level of safety stock coverage time depends in a highly non-linear manner on various economic parameters and shows threshold behavior.

Research limitations/implications

In subsequent studies, the effect of the degree of backlogging and the effect of the repeated occurrence of quality breakdowns on the results can be investigated.

Practical implications

The critical importance of safety stock and its non-linear relationship to economic product characteristics is emphasized.

Originality/value

Motivated by a real-world case study, the paper uses standard model formulations to derive insights for a specific business situation after considering uncertainty in the environment.

Details

Journal of Modelling in Management, vol. 15 no. 2
Type: Research Article
ISSN: 1746-5664

Keywords

Access Restricted. View access options
Article
Publication date: 27 June 2019

Wai Peng Wong, Hwee Chin Tan, Kim Hua Tan and Ming-Lang Tseng

The purpose of this paper is to explore the human factors triggering information leakage and investigate how companies mitigate insider threat for information sharing integrity.

2272

Abstract

Purpose

The purpose of this paper is to explore the human factors triggering information leakage and investigate how companies mitigate insider threat for information sharing integrity.

Design/methodology/approach

The methodology employed is multiple case studies approach with in-depth interviews with five multinational enterprises (MNEs)/multinational corporations (MNCs).

Findings

The findings reveal that information leakage can be approached with human governance mechanism such as organizational ethical climate and information security culture. Besides, higher frequency of leakages negatively affects information sharing integrity. Moreover, this paper also contributes to a research framework which could be a guide to overcome information leakage issue in information sharing.

Research limitations/implications

The current study involved MNCs/MNEs operating in Malaysia, while companies in other countries may have different ethical climate and information sharing culture. Thus, for future research, it will be good to replicate the study in a larger geographic region to verify the findings and insights of this research.

Practical implications

This research contributes to the industry and business that are striving toward solving the mounting problem of information leakage by raising awareness of human factors and to take appropriate mitigating governance strategies to pre-empt information leakage. This paper also contributes to a novel theoretical model that characterizes the iniquities of humans in sharing information, and suggests measures which could be a guide to avert disruptive leakages.

Originality/value

This paper is likely an unprecedented research in molding human governance in the domain of information sharing and its Achilles’ heel which is information leakage.

Details

Industrial Management & Data Systems, vol. 119 no. 6
Type: Research Article
ISSN: 0263-5577

Keywords

1 – 7 of 7
Per page
102050