SchedulingNon-permutation flowshopTime lagsMathematical programmingHeuristicsLexicographic optimizationIn this paper, we address the non-permutation flowshop scheduling problem with minimal and maximal time lags between successive operations of each job. For this problem, the set of permutation schedules is ...
In the present work, the non-permutation flow-shop scheduling problem with time lags has been studied to minimize the makespan as a performance measure. First, we obtain a near-optimal permutation solution using the permutation flow-shop problem (PFSP) heuristic. Then, an effective iterated ...
This study presents a multi-heuristic desirability ACS heuristic for the non-permutation flowshop scheduling problem, and verifies the effectiveness of the proposed heuristic by performing computational experiments on a well-known non-permutation flowshop benchmark problem set. Over three-quarters of the...
Non-permutation flowshop scheduling with dual resourcesNon-permutation flowshop scheduling with dual resourcesdoi:10.1016/j.eswa.2013.03.007SchedulingDualresourcesMixed-integerprogrammingNon-permutationflowshopSequence-dependentsetuptimeTypically, in order to process jobs in a flowshop both machines and labor ...
3.No-wait on-line supply chain scheduling problems with transfer time;带运输时间的无等待供应链在线调度问题研究 4.Researches on the No-Wait Permutation Flow Shop Earliness and Tardiness Scheduling Problem无等待排列流水车间提前/延期调度问题 5.Optimal scheduling of no-wait robotic cell with multi-type...
Shen, Wang, and Wang [37] presented an effective bi-population EDA to solve the no-idle permutation flow shop scheduling problem with the total tardiness criterion. Besides, the differential evolution (DE) is regarded as a traditional efficient evolutionary algorithm and it is well known for its...
Algebraic Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem With Total Flowtime Criterion This paper introduces an original algebraic approach to differential evolution (DE) algorithms for combinatorial search spaces. An abstract algebraic diffe... V Santucci,M Baioletti,A Mil...
A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. nondominated sortingPareto frontspermutationpopulation trimmingThis paper proposes a hybrid quantum-inspired genetic algorithm (HQGA) for the multiobjective flow ... L Wang,H Wu,F Tang,... - 《IEEE Transactions on ...
Rahimi-Vahed A, Mirzaei AH (2007) Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm. C. in Soft Computing. Springer, New York Google Scholar Luo X-H, Yang Y, Li X (2008) Solving TSP with shuffled frog-leaping algorithm. Proc ISDA 3:228–232 Goo...
The terms “Oracle Problem” and “Non-testable system” interchangeably refer to programs in which the application of test oracles is