Search
Now showing items 91-100 of 103
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion
(Algorithms, 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 ...
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 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 ...
An improved discrete artificial bee colony algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance
(Chinese Control Conference, CCC, 2020)
The distributed permutation flowshop scheduling problem with preventive maintenance operator (PM/DPFSP) is closely related to modem industry. This paper presents an improved discrete artificial bee colony (IDABC) algorithm ...
An Iterated Greedy Algorithm for Distributed Blocking Flowshop Problems with Makespan Minimization
(Chinese Control Conference, CCC, 2020)
In this paper, we study a distributed blocking flowshop scheduling problem (DBFSP) that is an extension of the traditional blocking flowshop scheduling problem (BFSP), in which an additional decision of which factory to ...
NEH-Based heuristics for the distributed blocking flowshop with makespan criterion
(Chinese Control Conference, CCC, 2020)
The distributed blocking flowshop scheduling problem (DBFSP) that is an important generalization of the traditional blocking flowshop scheduling problem (BFSP), in which the blocking constraint has to be considered. The ...
An iterated local search algorithm for distributed assembly permutation flowshop problem
(Chinese Control Conference, CCC, 2020)
Nowadays, the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper, we propose a group iterated local search (gILS) algorithm to solve the problem with total ...
A New Heuristic for PCBs Grouping Problem with Setup Times
(Chinese Control Conference, CCC, 2020)
In this paper, we present a new heuristic to divide a batch of printed circuit boards (PCBs) into subgroups to save the setup time for loading and unloading components from the assembly machine. In the heuristic, we propose ...
Energy-efficient single machine total weighted tardiness problem with sequence-dependent setup times
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 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 ...
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion
(Computers and Industrial Engineering, 2015)
This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job insertion includes two phases: initializing schedules and rescheduling after each new job insertion. ...
A multi-objective harmony search algorithm for sustainable design of floating settlements
(Algorithms, 2016)
This paper is concerned with the application of computational intelligence techniques to the conceptual design and development of a large-scale floating settlement. The settlement in question is a design for the area of ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
