The permutation flowshop scheduling problem (PFSP) has been extensively explored in scheduling literature because it has many real-world industrial implementations. In some studies, multiple objectives related t
Energy efficient permutation flowshop scheduling problem (PFSP) is widely studied to reduce the energy consumption in manufacturing systems. Most traditional studies make the premise that setup time is a component of processing time. However, this assumption does not satisfy the small batches, more va...
Flow shopLearning effectMachine learning exists in many realistic scheduling situations. This study focuses on permutation flow shop scheduling problems, where the actual processing time of a job is defined by a general non-increasing function of its scheduled position, i.e., general position-...
Sayadi M. M., Ramezanian R., GhaFAari-Nasb N.:A discrete firefly meta_heuristic with local search for makespan minimization in permutation flow shop scheduling problem. Imternational Journal of Industrial Engineering Computations 1 pp.1--10 (2010...
This paper considers the distributed permutation flowshop scheduling problem (DPFSP) which is an extension of permutation flowshop scheduling problem (PFSP). In DPFSP, there are multiple parallel factories instead of one factory as in PFSP. Each factory consists of same number of machines, and ...
Lévy flightCuckoo Search algorithmdynamic balance factorself-adaptive steppermutation flow shop scheduling problemThe problem of scheduling in permutation flow shop with the objective of minimizing the maximum completion time, or makespan, is considered. A new ant colony optimization algorithm is developed...
Lower bounds1 IntroductionThe problem that we address in this paper is the permutation flowshop schedulingproblem with time lags. Traditionally, flowshop scheduling models assume that fora given job, if its operation k precedes its operation l, then once the processing of theoperation k is complete...
(2016). Permutation flow-shop scheduling problem to optimize a quadratic objective function. Engineering Optimization. Ahead of Print.doi:10.1080/0305215X.2016.1261127Ren, TaoZhao, PengZhang, DaLiu, BingqianYuan, HuaweiBai, DanyuEngineering Optimization...
We are interested here in new sub cases for which permutation flow shop schedules are dominant while considering the classical flow shop scheduling problem and the makespan criterion. To obtain these sub cases, we introduce conditions on the lower ...
混合Flow-shop调度问题 1. In this paper, a new method solving hybrid flow-shop scheduling problem based on genetic algorithm is proposed. 混合Flow-shop调度问题 (Hybrid flow-shop scheduling problem, HFSP),是一般Flow-shop调度问题的推广,由于在某些工序上存在并行机器,所以比一般的Flow-shop调度问题更...