Search
Now showing items 1-8 of 8
Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion
(Knowledge-Based Systems, 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 ...
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 ...
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. ...
An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
(International Journal of Production Research, 2015)
This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) ...
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 ...
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion
(PERGAMON-ELSEVIER SCIENCE LTD, 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. ...
An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
(TAYLOR & FRANCIS LTD, 2015)
This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
