A hybrid cuckoo search algorithm in parallel batch processing machines with unequal job ready times
This paper deals with the problem of scheduling identical parallel batch processing machines. In this scheduling system, each machine processes a set of jobs in a batch simultaneously and each job in the batch is characterized by its processing time, ready time and job size. We propose a hybrid disc...
Main Authors: | Majumder, Arindam, Laha, Dipak, Suganthan, Ponnuthurai Nagaratnam |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/141031 |
Similar Items
-
Bacterial foraging optimization algorithm in robotic cells with sequence-dependent setup times
by: Majumder, Arindam, et al.
Published: (2021) -
Scheduling of Batch Processors in Semiconductor Manufacturing – A Review
by: Mathirajan, M., et al.
Published: (2003) -
Provably Efficient Adaptive Scheduling for Parallel Jobs
by: He, Yuxiong, et al.
Published: (2007) -
Local search approaches for patient scheduling problem in parallel operating theatre
by: Alimin, Nur Neesha
Published: (2020) -
A Model Of Parallel Kinematics For Machine Calibration
by: Hansen, Hans Norgaard, et al.
Published: (2016)