Priority scheduling to minimize the total tardiness for remanufacturing systems with flow-shop-type reprocessing lines

Kim, Jong Min; Zhou, Yue; Lee, Dong‐Ho

doi:10.1007/s00170-017-0057-z

Cited by 37 publications

(15 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Conversely, the optimization in terms of cost for proper resources utilization, BCR, asks for more work orders of engine overhaul. In general, scheduling a service-oriented manufacturing system must pursue customer satisfaction [ 47 ]. Due to the high value of the availability of aircraft engines, the costs of the operation of an MRO cannot disregard the contractual charges due to delays or overdue work orders.…”

Section: Analysis and Discussionmentioning

confidence: 99%

Joint Optimization of Process Flow and Scheduling in Service-Oriented Manufacturing Systems

Vargas

Calvo

2018

Materials

View full text Add to dashboard Cite

Customer-oriented management of manufacturing systems is crucial in service-oriented production and product service systems. This paper develops the selection of dispatching rules in combination with alternative process flow designs and demand mix, for a maintenance, repair and overhaul center (MRO) of turbo shaft engines, both for complete engines and engine modules. After an initial systematic screening of priority dispatching rules, the design of experiments and discrete-event simulation allows a quantitative analysis of the better rules for the alternative process flows with internal and service metrics. Next, the design of experiments with analysis of variance and the Taguchi approach enables a search for the optimal combination of process flow and dispatching rules. The consideration of extra costs for overdue work orders into the costing breakdown provides a quantitative evaluation of the optimum range of load for the facility. This facilitates the discussion of the significant trade-offs of cost, service, and flexibility in the production system and the operational management alternatives for decision-making.

show abstract

Section: Analysis and Discussionmentioning

confidence: 99%

Joint Optimization of Process Flow and Scheduling in Service-Oriented Manufacturing Systems

Vargas

Calvo

2018

Materials

View full text Add to dashboard Cite

show abstract

“…In consequence, the NPFS approach becomes constructive for two/three machines [58]. This analysis is being refined by newer results (Tab.…”

Section: Problemmentioning

confidence: 98%

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review

2021

View full text Add to dashboard Cite

Flow shop scheduling is a type of scheduling where sequence follows for each job on a set of machines for processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows the changes in the job order to flexibly manage such irregularity. The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries. The scope of this paper is to identify the literature available on permutation and non-permutation flow shop scheduling with no-wait constraint. This paper organizes scheduling problems based on performance measures of variability and shop environments. The extended summary of two/three-machine and m-machine problems has been compiled, including their objectives, algorithms, parametric considerations, and their findings. A systematic appearance of both conceptual and analytical results summarizes various advances of the no-wait constraint. The paper includes independently investigated problems and suggestions for future research directions.

show abstract

“…Ant Lion describes the position matrix for the Ant Lion according to (14) while the fitness function is represented by the matrix OAL based (15).…”

Section: Initialization Of the Search Agent Positionsmentioning

confidence: 99%

“…Moreover, a greedy A R T I C L E I N F O algorithm was used by Karabulut [6], while Fernandez-Viagas and Framinan [12] developed a nonpopulation-based algorithm. M'Hallah [13] also proposed a hybrid heuristic model, while Kim et al [14] suggested a new priority on flow shop scheduling. Despite the fact there are several kinds of literature on heuristics algorithm, NEH has been reported to perform effectively for PFSP cases [15].…”

Section: Introductionmentioning

confidence: 99%

An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem

Utama

Widodo

Ibrahim

et al. 2020

Int. J. Adv. Intell. Informatics

View full text Add to dashboard Cite

This article aimed to develop an improved Ant Lion algorithm. The objective function was to minimize the mean tardiness on the flow shop scheduling problem with a focus on the permutation flow shop problem (PFSP). The Hybrid Ant Lion Optimization Algorithm (HALO) with local strategy was proposed, and from the total search of the agent, the NEH-EDD algorithm was applied. Moreover, the diversity of the nominee schedule was improved through the use of swap mutation, flip, and slide to determine the best solution in each iteration. Finally, the HALO was compared with some algorithms, while some numerical experiments were used to show the performances of the proposed algorithms. It is important to note that comparative analysis has been previously conducted using the nine variations of the PFSSP problem, and the HALO obtained was compared to other algorithms based on numerical experiments.

show abstract

Priority scheduling to minimize the total tardiness for remanufacturing systems with flow-shop-type reprocessing lines

Cited by 37 publications

References 21 publications

Joint Optimization of Process Flow and Scheduling in Service-Oriented Manufacturing Systems

Joint Optimization of Process Flow and Scheduling in Service-Oriented Manufacturing Systems

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review

An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem

Contact Info

Product

Resources

About