This paper gives a review on existing scheduling methodologies developed for process
industries. Above all, the aim of the paper is to focus on the industrial aspects of scheduling …

In real-world scheduling problems, several kinds of hard-to-predict risk must be considered.
Scheduling under uncertainty allows these kinds of risks to be taken into account. This paper …

Due to the influence of dynamic changes in the manufacturing environment, a single
dispatching rule (SDR) cannot consistently attain better results than other rules for dynamic …

In this paper, reinforcement learning (RL) with a Q-factor algorithm is used to enhance
performance of the scheduling method proposed for dynamic job shop scheduling (DJSS) …

A scheduling method based on variable neighborhood search (VNS) is introduced in this
paper to address dynamic job shop scheduling problem that considers random job arrivals …

Priority-dispatching rules have been studied for many decades, and they form the backbone
of much industrial scheduling practice. Developing new dispatching rules for a given …

In most real manufacturing environments, schedules are usually inevitable with the
presence of various unexpected disruptions. In this paper, a rescheduling method based on …

The proposed scheduling strategy is based on a multi-agent architecture. Each agent of this
architecture is dedicated to a work centre (ie a set of resources of the manufacturing system); …

Provided herein are data structures, processes and systems to facilitate scheduling of
complex work orders to a mobile workforce. Complex work orders are comprised of several …

This study attempts to provide efficient dispatching rules for dynamic job shop scheduling by
combining different dispatching rules. A dispatching rule is used to select the next job to be …