Search
Now showing items 61-70 of 162
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion
(MDPI, 2019)
In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies ...
A General Variable Neighborhood Search for the No-Idle Flowshop Scheduling Problem with Makespan Criterion
(IEEE, 2019)
This paper proposes a novel general variable neighborhood search (GVNS) algorithm to solve the no-idle flowshop scheduling problem with the makespan criterion. The initial solution of the GVNS is generated using the FRB5 ...
Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times
(SPRINGER INTERNATIONAL PUBLISHING AG, 2018)
Most of the problems defined in the scheduling literature do not yet take into account the energy consumption of manufacturing processes, as in most of the variants with tardiness objectives. This study handles scheduling ...
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time
(SPRINGER INTERNATIONAL PUBLISHING AG, 2018)
Permutation flow shop scheduling problem (PFSP) is a well-known problem in the scheduling literature. Even though many multi-objective PFSPs are presented in the literature with the objectives related to production efficiency ...
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
(PERGAMON-ELSEVIER SCIENCE LTD, 2017)
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...
Design of multi-product multi-period two-echelon supply chain network to minimize bullwhip effect through differential evolution
(IEEE, 2017)
A supply chain network consists of facilities located in dispersed geographical locations. This network structure can be optimized to minimize total cost or total inventory by deciding the order quantities and distribution ...
A variable block insertion heuristic for permutation flowshops with makespan criterion
(IEEE, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
Variable Block Insertion Heuristic for the Quadratic Assignment Problem
(IEEE, 2017)
The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making ...
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
(MDPI AG, 2016)
In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum ...
Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion
(ELSEVIER SCIENCE BV, 2016)
This study addresses flexible job shop scheduling problem (FJSP) with two constraints, namely fuzzy processing time and new job insertion. The uncertainty of processing time and new job insertion are two scheduling related ...