TITLE

Two-stage flow-shop scheduling problem with non-identical second stage assembly machines

AUTHOR(S)
Navaei, J.; Ghomi, S. M. T. Fatemi; Jolai, F.; Shiraqai, M. E.; Hidaji, H.
PUB. DATE
December 2013
SOURCE
International Journal of Advanced Manufacturing Technology;Dec2013, Vol. 69 Issue 9-12, p2215
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear programming model of this problem is defined, and for it being NP-hard, a hybrid SA heuristic is proposed. The heuristic is proved to solve the problem in reduced time with negligible error. To validate the proposed method, a real-life example is presented and solved in which the efficiency of the proposed heuristic is shown.
ACCESSION #
92017993

 

Related Articles

  • An Efficient Approach for Solving Reliable Facility Location Models. Aboolian, Robert; Tingting Cui; Zuo-Jun Max Shen // INFORMS Journal on Computing;Fall2013, Vol. 25 Issue 4, p720 

    We consider reliable facility location models in which facilities are subject to unexpected failures, and customers may be reassigned to facilities other than their regular facilities. The objective is to minimize the total expected costs in normal and failure scenarios. We allow facilities to...

  • Flow Merging and Hub Route Optimization in Collaborative Transportation. Kerui Weng; Zi-hao Xu // Journal of Applied Mathematics;2014, p1 

    This paper studies the optimal hub routing problem of merged tasks in collaborative transportation. This problem allows all carriers' transportation tasks to reach the destinations optionally passing through 0, 1, or 2 hubs within limited distance, while a cost discount on arcs in the hub route...

  • MILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints. Ramezanian, R. // International Journal of Applied Operational Research;Autumn2014, Vol. 4 Issue 4, p11 

    In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer...

  • Comparing mathematical and heuristic rules for solving single machine scheduling problem with release and due date constraints. Yong Zhan; Haitao Zhu; Yuguang Zhong // Applied Mechanics & Materials;2014, Issue 630-642, p1707 

    The purpose of this paper is to compare a mixed integer programming(MIP) model, and heuristic rules based on their practical efficiency and the accuracy of results to tackle the minimum lateness single machine scheduling problem with release and due date constraints. Extensive numerical...

  • Task Rescheduling Model for Resource Disruption Problem in Unrelated Parallel Processor System. Nordina, Syarifah Zyurina; Caccettab, Lou // AIP Conference Proceedings;2014, Vol. 1605, p1086 

    In this paper, we concentrate on the scheduling problem with interruption occurs in the parallel processor system. The situation happens when the availability of the unrelated parallel processors in the time slot decreases in certain time periods and its define as resource disruption. Our...

  • A mathematical model and a heuristic approach for periodic material delivery in lean production environment. Kilic, Huseyin; Durmusoglu, Mehmet // International Journal of Advanced Manufacturing Technology;Nov2013, Vol. 69 Issue 5-8, p977 

    One of the important design elements for a good production system is material handling. In cases where it is not well-designed, it can be the bottleneck in the system. Moreover, it can cause a lot of wastes such as waiting time, idle time, and excessive transportation and cost. In this study,...

  • Time-partitioning heuristic algorithm for optimal production, inventory, and transportation planning with direct shipment. Napaporn Rianthong; Aussadavut Dumrongsiri // Songklanakarin Journal of Science & Technology;May/Jun2013, Vol. 35 Issue 3, p369 

    We developed a mixed integer linear programming model for an integrated decision problem of production, inventory, and transportation planning. Our model combines the direct shipment into the production, inventory, and distribution planning. The objective was to minimize the total operation cost...

  • An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. Coco, Amadeu; Júnior, João; Noronha, Thiago; Santos, Andréa // Journal of Global Optimization;Oct2014, Vol. 60 Issue 2, p265 

    The well-known Shortest Path problem (SP) consists in finding a shortest path from a source to a destination such that the total cost is minimized. The SP models practical and theoretical problems. However, several shortest path applications rely on uncertain data. The Robust Shortest Path...

  • MineLib: a library of open pit mining problems. Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Newman, Alexandra // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p93 

    Similar to the mixed-integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics