-
Article
Open AccessCorrection: N-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling
-
Article
Reinforcement learning iterated greedy algorithm for distributed assembly permutation flowshop scheduling problems
Integrating component and final assembly production plans is critical to optimizing the global supply chain production system. This research extends the distributed assembly permutation flowshop scheduling pro...
-
Article
Open AccessN-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling
System-wide optimization of distributed manufacturing operations enables process improvement beyond the standalone and individual optimality norms. This study addresses the production planning of a distributed...
-
Article
Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups
Integrated scheduling of distributed manufacturing operations has implications for supply chain optimization and requires further investigations to facilitate its application area for various industry settings...
-
Article
Open AccessSingle machine scheduling problems with sequence-dependent setup times and precedence delays
Sequence-dependent setup times and precedence delays occur frequently in various production environments. This study investigates the single machine scheduling problem with setup times and precedence delays th...
-
Article
Intelligent parametric design for a multiple-quality-characteristic glue-dispensing process
For double-sided circuit boards, a wave soldering carrier is generally used to shield the devices mounted on the surface of the first side of the printed circuit board (PCB), so that the solder joints are not ...
-
Article
Scheduling the two-machine flowshop to hedge against processing time uncertainty
This paper addresses the two-machine flowshop scheduling problem with uncertain job processing times. It is assumed that in the realization of a schedule, job processing times may take any values from their co...
-
Article
Makespan minimization for scheduling unrelated parallel machines with setup times
This study considers the problem of scheduling jobs on unrelated parallel machines with machine-dependent and job sequence-dependent setup times. In this study, a restricted simulated annealing (RSA) algorithm...
-
Article
Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups
This paper examines the no-wait flowshop manufacturing cell scheduling problem (FMCSP) with sequence-dependent family setup times. To the best of our knowledge, the present study is among the first to investig...
-
Article
Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints
The unrelated parallel machine scheduling problem with sequence- and machine-dependent setup times in the presence of due date constraints represents an important but relatively less-studied scheduling problem...
-
Article
Meta-heuristic algorithms for wafer sorting scheduling problems
Wafer sorting is usually regarded as the most critical stage in the whole wafer probing process. This paper discusses the wafer sorting scheduling problem (WSSP) with total setup time minimization as the prima...
-
Article
Applying PSO-based BPN for predicting the yield rate of DRAM modules produced using defective ICs
Dynamic random access memory (DRAM) modules are an important component of electronic equipment, impacting the quality, performance, and price of the final product. A typical DRAM module is composed of DRAM int...
-
Article
Scheduling jobs on dynamic parallel machines with sequence-dependent setup times
Dynamic parallel machine scheduling problems (DPMSPs) with sequence-dependent setup times represent a very important production scheduling problem but remain under-represented in the research literature. In th...
-
Article
An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem
In this paper, an enhanced ant colony optimization (EACO) is proposed for capacitated vehicle routing problem. The capacitated vehicle routing problem is to service customers with known demands by a homogeneou...
-
Article
Hybrid-directional planning: improving improvement heuristics for scheduling resource-constrained projects
The resource-constrained project scheduling problem (RCPSP) has been of a continuing interest and challenge for researchers and practitioners since its advent. The formidable computational requirements of the ...
-
Article
Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic
Flowshop scheduling problems have received considerable research attention over the last five decades. This study proposes an iterated greedy heuristic for non-permutation flowshop scheduling problems. To vali...
-
Chapter
A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date
The problem of scheduling jobs on a single machine with a common due date is one of NP-complete problems. It is to minimize the total earliness and tardiness penalties. This chapter introduces a Dynamical Ant ...
-
Article
Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics
Simulated annealing (SA), genetic algorithms (GA), and tabu search (TS) are the three well known meta-heuristics for combinatorial optimization problems. In this paper, single-machine total weighted tardiness ...
-
Article
Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems
Ant colony optimization (ACO) is a novel intelligent meta-heuristic originating from the foraging behavior of ants. An efficient heuristic of ACO is the ant colony system (ACS). This study presents a multi-heu...
-
Chapter and Conference Paper
An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date
In this paper, an intelligent algorithm for scheduling jobs on a single machine with a common due date is introduced. This problem of scheduling jobs on a single machine, known as NP-complete problem, is again...
