A survey of scheduling problems with no-wait in process

Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem

An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem

This paper proposes an improved artificial bee colony (IABC) algorithm for addressing the distributed flow shop considering the distance coefficient found in precast concrete production system, wit...

An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system

The traditional flexible job shop scheduling problem (FJSP) considers machine flexibility but not worker flexibility. Given the influence and potential of human factors in improving production effi...

A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility

This paper studies a hybrid artificial bee colony (ABC) algorithm for finding high quality solutions of the job-shop scheduling problem with no-wait constraint (JSPNW) with the objective of minimizing makespan among all the jobs. JSPNW is an extension of well-known job-shop scheduling problem subject to the constraint that no waiting time is allowed between operations for a given job. ABC algorithm is a swarm intelligence technique based on intelligent foraging behavior of honey bee swarm. The proposed hybrid approach effectively coordinates the various components of ABC algorithm such as solution initialization, selection and determination of a neighboring solution with the local search in such a way that it leads to high quality solutions for the JSPNW. The proposed approach is compared with the two best approaches in the literature on a set of benchmark instances. Computational results show the superiority of the proposed approach over these two best approaches.

Cai Tian Xiang

Papers

A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint